The Komlós conjecture for graphs of girth 7

DOI10.1016/S0012-365X(99)00316-7MaRDI QIDQ1972153zbMATH OpenOpenAlexWikidataFDO

Authors Sara Nadiv Soffer

Publication date 23 October 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00316-7

zbMATH Keywords

treesgirthmedian degree

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• scientific article; zbMATH DE number 4053652
• On well-covered graphs of odd girth 7 or greater
• Seven problems on hypohamiltonian and almost hypohamiltonian graphs
• Maximally non-hamiltonian graphs of girth 7
• A characterization of well-indumatchable graphs having girth greater than seven
• scientific article; zbMATH DE number 434495
• Hadwiger's conjecture for the complements of Kneser graphs
• Gallai's conjecture for graphs of girth at least four
• Graphs of odd girth 7 with large degree
• Graphs of girth at least 7 have high \(b\)-chromatic number

Cited in

(9)

• scientific article; zbMATH DE number 7340788 (Why is no real title available?)
• Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
• Strong 2-degenerate graph embeddings
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• Embedding trees in graphs with independence number two
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
• Loebl-Komlós-Sós conjecture: dense case
• On a conjecture about trees in graphs with large girth

This page was built for publication: The Komlós conjecture for graphs of girth 7

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972153)