Large Simple d-Cycles in Simplicial Complexes

Autor:	Meshulam, Roy, Newman, Ilan, Rabinovich, Yuri
Rok vydání:	2019
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	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 Erd\H{o}s and Gallai \cite{EG59} for graphs. We use methods from matroid theory applied to combinatorial simplicial complexes. Comment: 9npages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1910.04605 Zobrazit plný text záznamu View this record from Arxiv