Mycielski type constructions for hypergraphs associated with fractional colorings

DOI10.1007/s40590-013-0001-7zbMath1306.05173OpenAlexW2049090624MaRDI QIDQ2254688

J. Luviano, Luis Montejano, Amanda Montejano, Deborah Oliveros

Publication date: 6 February 2015

Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40590-013-0001-7

zbMATH Keywords

uniform hypergraphsMycielski constructionfractional chromatic number of hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Exploring the concept of perfection in 3-hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Claw-free graphs. VI: Colouring
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Vertex colouring and forbidden subgraphs -- a survey
• Graph Theory and Probability
• Radius two trees specify χ‐bounded classes
• The fractional chromatic number of mycielski's graphs
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• Sur le coloriage des graphs