A Note on Packing Graphs Without Cycles of Length up to Five
The Electronic Journal of Combinatorics2009Vol. 16(1)
Citations Over TimeTop 21% of 2009 papers
Abstract
The following statement was conjectured by Faudree, Rousseau, Schelp and Schuster: if a graph $G$ is a non-star graph without cycles of length $m \leq 4$ then $G$ is a subgraph of its complement. So far the best result concerning this conjecture is that every non-star graph $G$ without cycles of length $m \leq 6$ is a subgraph of its complement. In this note we show that $m\leq 6$ can be replaced by $m \leq 5$.
Related Papers
- → The Zalcman conjecture and related problems(2009)1 cited
- → Overpartitions and Bressoud's conjecture, II(2020)1 cited
- A Study of the Complement System in TCSL(2006)
- Summary of Studies on Structure of "X+Tou"(2008)
- → A Note on the Permuted Puzzles Toy Conjecture(2021)