Large Simple d-Cycles in Simplicial Complexes
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 Erdos and Gallai EG59 for graphs. We use methods from matroid theory applied to combinatorial simplicial complexes.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.