Counterexamples to a conjecture on matching Kneser graphs

DOI10.22108/TOC.2022.132638.1961MaRDI QIDQ5046003zbMATH OpenFDO

Authors M. N. Iradmusa

Publication date 8 November 2022

Full work available at URL https://arxiv.org/abs/2107.04998

zbMATH Keywords

chromatic numbersnarksmatching Kneser graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the chromatic number of matching Kneser graphs
• A generalization of Kneser's conjecture
• Matchings and Hadwiger's conjecture
• A note on a conjecture on maximum matching in almost regular graphs
• Berge-Fulkerson conjecture on certain snarks

Cites work

• Kneser's conjecture, chromatic number, and homotopy
• On the chromatic number of matching Kneser graphs

Cited in

(9)

• scientific article; zbMATH DE number 11353 (Why is no real title available?)
• Counterexamples to three conjectures concerning perfect graphs
• scientific article; zbMATH DE number 1933066 (Why is no real title available?)
• A counterexample to the bipartizing matching conjecture
• More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures
• Counterexamples to a conjecture of Mader about cycles through specified vertices in n-edge-connected graphs
• Counterexamples to a conjecture on matching Kneser graphs
• Counterexamples to the conjecture on orientations of graphs with minimum Wiener index
• Concerning a conjecture on matching Kneser graphs

This page was built for publication: Counterexamples to a conjecture on matching Kneser graphs

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