
doi: 10.1002/jgt.10044
AbstractThe notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an adversary. We show that the techniques used and bounds obtained on the extremal (r,m)‐split coloring problem of [7] are closer in nature to the Turán theory of graphs rather than Ramsey theory. We extend the notion of these colorings to hypergraphs and provide bounds and some exact results. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 226–237, 2002
affine plane, Extremal problems in graph theory, Ramsey coloring problem, Generalized Ramsey theory, Hypergraphs, Combinatorial aspects of block designs, Turán theory, group divisible design, split coloring, Coloring of graphs and hypergraphs, complete \(k\)-uniform hypergraph, total colorings, balanced coloring
affine plane, Extremal problems in graph theory, Ramsey coloring problem, Generalized Ramsey theory, Hypergraphs, Combinatorial aspects of block designs, Turán theory, group divisible design, split coloring, Coloring of graphs and hypergraphs, complete \(k\)-uniform hypergraph, total colorings, balanced coloring
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
