Large simple d-cycles in simplicial complexes
From MaRDI portal
Publication:6074040
DOI10.1007/S11856-023-2512-XzbMATH Open1522.05505arXiv1910.04605OpenAlexW2979969169MaRDI QIDQ6074040FDOQ6074040
Ilan Newman, Yuri Rabinovich, Roy Meshulam
Publication date: 12 October 2023
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Abstract: We show that the size of the largest simple d-cycle in a simplicial d-complex is at least a square root of 's density. This generalizes a well-known classical result of ErdH{o}s and Gallai cite{EG59} for graphs. We use methods from matroid theory applied to combinatorial simplicial complexes.
Full work available at URL: https://arxiv.org/abs/1910.04605
Recommendations
Combinatorial aspects of matroids and geometric lattices (05B35) Distance in graphs (05C12) Paths and cycles (05C38) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Title not available (Why is that?)
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- Isoperimetric inequalities for Ramanujan complexes and topological expanders
- An extremal function for contractions of graphs
- Title not available (Why is that?)
- Graph Theory
- Collapsibility and vanishing of top homology in random simplicial complexes
- On the phase transition in random simplicial complexes
- An extended Euler-Poincaré theorem
- On infinite antichains of matroids
- Cliques in dense GF(\(q\))-representable matroids
- Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes
- Small cocircuits in matroids
- 2-complexes with large 2-girth
This page was built for publication: Large simple \(d\)-cycles in simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074040)
