Homological connectedness of random hypergraphs

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

Originalspracheenglisch
TitelProceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics
Seiten279-285
PublikationsstatusVeröffentlicht - 2017

Dies zitieren

Cooley, O. J. N., Haxell, P., Kang, M., & Sprüssel, P. (2017). Homological connectedness of random hypergraphs. in Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics (S. 279-285)

Homological connectedness of random hypergraphs. / Cooley, Oliver Josef Nikolaus; Haxell, Penny; Kang, Mihyun; Sprüssel, Philipp.

Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics. 2017. S. 279-285.

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

Cooley, OJN, Haxell, P, Kang, M & Sprüssel, P 2017, Homological connectedness of random hypergraphs. in Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics. S. 279-285.
Cooley OJN, Haxell P, Kang M, Sprüssel P. Homological connectedness of random hypergraphs. in Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics. 2017. S. 279-285
Cooley, Oliver Josef Nikolaus ; Haxell, Penny ; Kang, Mihyun ; Sprüssel, Philipp. / Homological connectedness of random hypergraphs. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics. 2017. S. 279-285
@inproceedings{3cf7d33818e346d1bc313a6bb40b919e,
title = "Homological connectedness of random hypergraphs",
author = "Cooley, {Oliver Josef Nikolaus} and Penny Haxell and Mihyun Kang and Philipp Spr{\"u}ssel",
year = "2017",
language = "English",
pages = "279--285",
booktitle = "Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics",

}

TY - GEN

T1 - Homological connectedness of random hypergraphs

AU - Cooley, Oliver Josef Nikolaus

AU - Haxell, Penny

AU - Kang, Mihyun

AU - Sprüssel, Philipp

PY - 2017

Y1 - 2017

M3 - Conference contribution

SP - 279

EP - 285

BT - Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics

ER -