Large simple d-cycles in simplicial complexes

Research output: Contribution to journalArticlepeer-review

Abstract

We show that the size of the largest simple d-cycle in a simplicial d-complex K is at least a square root of K’s density. This is a higher dimensional relative of a classical result of Erdős and Gallai [7], claiming that any graph G contains a simple cycle of size at least linear in G’s density.

Original languageEnglish
Pages (from-to)581-597
Number of pages17
JournalIsrael Journal of Mathematics
Volume256
Issue number2
DOIs
StatePublished - Sep 2023

Bibliographical note

Funding Information:
Supported in part by the Israel Science Foundation, grant 326/16.

Funding Information:
We are very grateful to Jan van den Heuvel from the London School of Economics for an insightful discussion which led to the formulation of the main question addressed in this paper.

Funding Information:
Supported in part by the Israel Science Foundation, grant 497/17. Acknowledgements

Publisher Copyright:
© 2023, The Hebrew University of Jerusalem.

ASJC Scopus subject areas

  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Large simple d-cycles in simplicial complexes'. Together they form a unique fingerprint.

Cite this