Some old and new problems in various branches of combinatorics
From MaRDI portal
Publication:1356747
DOI10.1016/S0012-365X(96)00173-2zbMath0872.05020OpenAlexW2123293563WikidataQ127845827 ScholiaQ127845827MaRDI QIDQ1356747
No author found.
Publication date: 5 October 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00173-2
Extremal problems in graph theory (05C35) Other combinatorial number theory (11B75) Erd?s problems and related topics of discrete geometry (52C10) Lists of open problems (00A27)
Related Items (18)
On 2-power unicyclic cubic graphs ⋮ On the local density problem for graphs of given odd-girth ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sparse halves in K4‐free graphs ⋮ K4$K_4$‐free graphs have sparse halves ⋮ Erdős-Gyárfás conjecture for some families of Cayley graphs ⋮ The Spectrum of Triangle-Free Graphs ⋮ A solution to Erdős and Hajnal’s odd cycle problem ⋮ Erdős-Gyárfás conjecture for cubic planar graphs ⋮ Gaps in the cycle spectrum of 3-connected cubic planar graphs ⋮ Sparse halves in dense triangle-free graphs ⋮ On \(q\)-power cycles in cubic graphs ⋮ Sparse halves in triangle-free graphs ⋮ On the Erdős-Gyárfás conjecture in claw-free graphs ⋮ On a conjecture of Bondy and Vince ⋮ More about sparse halves in triangle-free graphs ⋮ Erdős-Gyárfás conjecture for \(P_8\)-free graphs
This page was built for publication: Some old and new problems in various branches of combinatorics
