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
Paul Erdős, Daniel J. Kleitman
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (38)
2-Cancellative Hypergraphs and Codes ⋮ All rationals occur as exponents ⋮ Implications of forbidden structures for extremal algorithmic problems ⋮ Linear upper bounds for local Ramsey numbers ⋮ Minimal paths and cycles in set systems ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ A note on local colorings of graphs ⋮ Some extremal results on hypergraph Turán problems ⋮ The size of the largest bipartite subgraphs ⋮ Graph Coloring Using Eigenvalue Decomposition ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Linear cycles of consecutive lengths ⋮ New bounds for a hypergraph bipartite Turán problem ⋮ Kalai's conjecture in \(r\)-partite \(r\)-graphs ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results ⋮ Turán and Ramsey numbers in linear triple systems ⋮ New Turán Exponents for Two Extremal Hypergraph Problems ⋮ Asymptotically optimal erasure-resilient codes for large disk arrays. ⋮ Turán number of special four cycles in triple systems ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ Partitioning ordered hypergraphs ⋮ Remarks on generic stability in independent theories ⋮ On a conjecture of Thomassen concerning subgraphs of large girth ⋮ Cycles of given lengths in hypergraphs ⋮ An application of the regularity lemma in generalized Ramsey theory ⋮ Relative Turán numbers for hypergraph cycles ⋮ Hypergraphs in which all disjoint pairs have distinct unions ⋮ A variant of the classical Ramsey problem ⋮ A hypergraph extension of the bipartite Turán problem ⋮ On the existence of triangulated spheres in 3-graphs, and related problems ⋮ Hypergraph cuts above the average ⋮ On a Turán-type hypergraph problem of Brown, Erdős and T. Sós ⋮ On finite set-systems whose every intersection is a kernel of a star ⋮ On disjointly representable sets ⋮ Anti-Ramsey colorings in several rounds ⋮ Set systems with three intersections ⋮ Extremal problems for convex geometric hypergraphs and ordered hypergraphs ⋮ Union-free families of sets and equations over fields
This page was built for publication: On coloring graphs to maximize the proportion of multicolored k-edges
