Pretraga

Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 1252724

Asymptotic Enumeration of Hypergraphs by Degree Sequence

Kamcev, Nina; Liebenau, Anita; Wormald, Nick
Asymptotic Enumeration of Hypergraphs by Degree Sequence // Advances in Combinatorics, 1 (2022), 1, 36 doi:10.19086/aic.32357 (međunarodna recenzija, članak, znanstveni)

CROSBI ID: 1252724 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Asymptotic Enumeration of Hypergraphs by Degree Sequence

Autori
Kamcev, Nina ; Liebenau, Anita ; Wormald, Nick

Izvornik
Advances in Combinatorics (2517-5599) 1 (2022); 1, 36

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
asymptotic enumeration

Sažetak
We prove an asymptotic formula for the number of k-uniform hypergraphs with a given degree sequence, for a wide range of parameter

Izvorni jezik
Engleski

Znanstvena područja
Matematika



POVEZANOST RADA

Profili:

Avatar Url Nina Kamčev (autor)

Poveznice na cjeloviti tekst rada:

doi www.advancesincombinatorics.com

Citiraj ovu publikaciju:

Kamcev, Nina; Liebenau, Anita; Wormald, Nick
Asymptotic Enumeration of Hypergraphs by Degree Sequence // Advances in Combinatorics, 1 (2022), 1, 36 doi:10.19086/aic.32357 (međunarodna recenzija, članak, znanstveni)
Kamcev, N., Liebenau, A. & Wormald, N. (2022) Asymptotic Enumeration of Hypergraphs by Degree Sequence. Advances in Combinatorics, 1, 1, 36 doi:10.19086/aic.32357.
@article{article, author = {Kamcev, Nina and Liebenau, Anita and Wormald, Nick}, year = {2022}, pages = {36}, DOI = {10.19086/aic.32357}, chapter = {1}, keywords = {asymptotic enumeration}, journal = {Advances in Combinatorics}, doi = {10.19086/aic.32357}, volume = {1}, issn = {2517-5599}, title = {Asymptotic Enumeration of Hypergraphs by Degree Sequence}, keyword = {asymptotic enumeration}, chapternumber = {1} }
@article{article, author = {Kamcev, Nina and Liebenau, Anita and Wormald, Nick}, year = {2022}, pages = {36}, DOI = {10.19086/aic.32357}, chapter = {1}, keywords = {asymptotic enumeration}, journal = {Advances in Combinatorics}, doi = {10.19086/aic.32357}, volume = {1}, issn = {2517-5599}, title = {Asymptotic Enumeration of Hypergraphs by Degree Sequence}, keyword = {asymptotic enumeration}, chapternumber = {1} }

Časopis indeksira:


  • Scopus

Citati:

    Altmetrijski pokazatelji:


    Podijeli:





    Contrast
    Increase Font
    Decrease Font
    Dyslexic Font
    CROSBI koristi kolačiće (cookies) kako bi poboljšao funkcionalnost stranice.