Imbalances in k‐colorations

DOI10.1002/net.3230010407zbMath0248.05114OpenAlexW2062670301WikidataQ105697986 ScholiaQ105697986MaRDI QIDQ5661913

Paul Erdős, J. H. Spencer

Publication date: 1972

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230010407

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

Quasi-Random Set Systems ⋮ Discrepancy of random graphs and hypergraphs ⋮ How unproportional must a graph be? ⋮ Turán's theorem for pseudo-random graphs ⋮ Discrepancies of spanning trees and Hamilton cycles ⋮ Color‐biased Hamilton cycles in random graphs ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ A Sequence of Triangle-Free Pseudorandom Graphs ⋮ Extremal results in sparse pseudorandom graphs ⋮ Intersections of random hypergraphs and tournaments ⋮ Intersections of hypergraphs ⋮ On testing the `pseudo-randomness' of a hypergraph ⋮ Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions ⋮ Triangle‐factors in pseudorandom graphs ⋮ Pseudo-random hypergraphs

This page was built for publication: Imbalances in k‐colorations