Large simple d-cycles in simplicial complexes
From MaRDI portal
Publication:6074040
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 5174567 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- 2-complexes with large 2-girth
- An extended Euler-Poincaré theorem
- An extremal function for contractions of graphs
- Cliques in dense GF(\(q\))-representable matroids
- Collapsibility and vanishing of top homology in random simplicial complexes
- Graph theory
- Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes
- Isoperimetric inequalities for Ramanujan complexes and topological expanders
- On infinite antichains of matroids
- On maximal paths and circuits of graphs
- On the phase transition in random simplicial complexes
- Small cocircuits in matroids
Cited in
(3)
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)