On coloring graphs to maximize the proportion of multicolored k-edges
From MaRDI portal
Publication:5554168
DOI10.1016/S0021-9800(68)80051-1zbMath0167.22302WikidataQ30048399 ScholiaQ30048399MaRDI QIDQ5554168
Daniel J. Kleitman, Paul Erdős
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
An application of the regularity lemma in generalized Ramsey theory, Hypergraphs in which all disjoint pairs have distinct unions, On finite set-systems whose every intersection is a kernel of a star, On disjointly representable sets, Set systems with three intersections, Union-free families of sets and equations over fields, All rationals occur as exponents, Implications of forbidden structures for extremal algorithmic problems, Linear upper bounds for local Ramsey numbers, A variant of the classical Ramsey problem, A note on local colorings of graphs, The size of the largest bipartite subgraphs, A hypergraph extension of the bipartite Turán problem, Anti-Ramsey colorings in several rounds, Asymptotically optimal erasure-resilient codes for large disk arrays., Minimal paths and cycles in set systems, On the existence of triangulated spheres in 3-graphs, and related problems, On a Turán-type hypergraph problem of Brown, Erdős and T. Sós, Graph Coloring Using Eigenvalue Decomposition
