On splittable colorings of graphs and hypergraphs

DOI10.1002/JGT.10044zbMath0996.05048OpenAlexW2527966071MaRDI QIDQ3150170

Radhika Ramamurthi, Zoltan Fueredi

Publication date: 29 September 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10044

zbMATH Keywords

group divisible designaffine planecomplete \(k\)-uniform hypergraphbalanced coloringtotal coloringsTurán theorysplit coloringRamsey coloring problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (2)

A lower bound for the chromatic capacity in terms of the chromatic number of a graph ⋮ The Adaptable Chromatic Number and the Chromatic Number

Cites Work

• Unnamed Item
• Hypergraphs with high chromatic number
• Split and balanced colorings of complete graphs
• Generalized split graphs and Ramsey numbers
• New asymptotics for bipartite Turán numbers
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order

This page was built for publication: On splittable colorings of graphs and hypergraphs