EUVIMEDEUVIMED entdecken
Crossref

Counting hypergraphs with large girth

Sam Spiro, Jacques Verstraëte

Journal of Graph Theory · 2022-07 · 100 (3) · 543-558

DOI: 10.1002/jgt.22794 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 12.01.2022. Verfasst von Sam Spiro und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 24 Literaturangaben. Gefördert von: ETH Zürich Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Morris and Saxton used the method of containers to bound the number of ‐vertex graphs with edges containing no ‐cycles, and hence graphs of girth more than . We consider a generalization to ‐uniform hypergraphs. The girth of a hypergraph is the minimum such that there exist distinct vertices and hyperedges with for all . Letting denote the number of ‐vertex ‐uniform hypergraphs with edges and girth larger than and defining , we show which is tight when divides up to a term in the exponent. This result is used to address the extremal problem for subgraphs of girth more than in random ‐uniform hypergraphs.

Förderung

  • ETH Zürich Foundation

Zitieren

APA

Spiro, S., & Verstraëte, J. (2022). Counting hypergraphs with large girth. Journal of Graph Theory, 100(3), 543-558. https://doi.org/10.1002/jgt.22794

Vancouver

Spiro S, Verstraëte J. Counting hypergraphs with large girth. Journal of Graph Theory. 2022;100(3):543-558. doi:10.1002/jgt.22794

BibTeX
@article{Spiro2022,
  author = {Spiro, Sam and Verstraëte, Jacques},
  title = {Counting hypergraphs with large girth},
  journal = {Journal of Graph Theory},
  year = {2022},
  volume = {100},
  number = {3},
  pages = {543--558},
  doi = {10.1002/jgt.22794}
}
Kostenlos starten →