Indexed metadata

A Note on Packing Graphs Without Cycles of Length up to Five

Agnieszka Görlich, Andrzej Żak

Source record

Source: Crossref

Published: Oct 26, 2009

DOI: 10.37236/268

Open original source ↗

Source abstract

The following statement was conjectured by Faudree, Rousseau, Schelp and Schuster: if a graph GG is a non-star graph without cycles of length m≤4m \leq 4 then GG is a subgraph of its complement. So far the best result concerning this conjecture is that every non-star graph GG without cycles of length m≤6m \leq 6 is a subgraph of its complement. In this note we show that m≤6m\leq 6 can be replaced by m≤5m \leq 5.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A Note on Packing Graphs Without Cycles of Length up to Five — Mathematical Frontier Network