Hall ratio of the Mycielski graphs

DOI10.1016/j.disc.2005.09.020zbMath1103.05030OpenAlexW1983930466MaRDI QIDQ2501574

Mathew Cropper, András Gyárfás, Jenő Lehel

Publication date: 14 September 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.020

zbMATH Keywords

fractional chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Connectivity of the generalised Mycielskian of digraphs ⋮ On colorful edge triples in edge-colored complete graphs ⋮ Questions on color-critical subgraphs ⋮ 1-subdivisions, the fractional chromatic number and the Hall ratio ⋮ Maximum directed cuts in graphs with degree constraints ⋮ Graph classes generated by Mycielskians ⋮ Online sum-paintability: the slow-coloring game ⋮ Revisiting a theorem by Folkman on graph colouring ⋮ On the ultimate lexicographic Hall-ratio ⋮ The fractional chromatic number, the Hall ratio, and the lexicographic product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A problem seminar
• The fractional chromatic number of mycielski's graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs

This page was built for publication: Hall ratio of the Mycielski graphs