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 K is at least a square root of K'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.









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)