The asymptotic number of connected d-uniform hypergraphs

Michael Behrisch; Amin Coja-Oghlan; Mihyun Kang

doi:10.1017/S0963548314000029

The asymptotic number of connected d-uniform hypergraphs

Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	367-385
Journal	Combinatorics, Probability & Computing
Volume	23
Issue number	3
DOIs	https://doi.org/10.1017/S0963548314000029
Publication status	Published - 2014

Fields of Expertise

Information, Communication & Computing

Treatment code (Nähere Zuordnung)

Basic - Fundamental (Grundlagenforschung)

Access to Document

10.1017/S0963548314000029

DFG - Phase transit.rand.graphs - Phase transitions in random graphs and random graph processes
Pachon Pinzon, A. Y. & Kang, M.
1/03/12 → 30/09/14
Project: Research project

Cite this

@article{1797ef0b3ef34bd3b19adbbc8fa3bffd,

title = "The asymptotic number of connected d-uniform hypergraphs",

author = "Michael Behrisch and Amin Coja-Oghlan and Mihyun Kang",

note = "accepted for publication",

year = "2014",

doi = "10.1017/S0963548314000029",

language = "English",

volume = "23",

pages = "367--385",

journal = "Combinatorics, Probability & Computing",

issn = "1469-2163",

publisher = "Cambridge University Press",

number = "3",

}

TY - JOUR

T1 - The asymptotic number of connected d-uniform hypergraphs

AU - Behrisch, Michael

AU - Coja-Oghlan, Amin

AU - Kang, Mihyun

N1 - accepted for publication

PY - 2014

Y1 - 2014

U2 - 10.1017/S0963548314000029

DO - 10.1017/S0963548314000029

M3 - Article

SN - 1469-2163

VL - 23

SP - 367

EP - 385

JO - Combinatorics, Probability & Computing

JF - Combinatorics, Probability & Computing

IS - 3

ER -

The asymptotic number of connected d-uniform hypergraphs

Fields of Expertise

Treatment code (Nähere Zuordnung)

Access to Document

Projects

DFG - Phase transit.rand.graphs - Phase transitions in random graphs and random graph processes

Cite this