Asymptotically good list-colorings
From MaRDI portal
Publication:1906118
DOI10.1006/jcta.1996.0001zbMath0851.05081OpenAlexW2024769658MaRDI QIDQ1906118
Publication date: 13 May 1996
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1996.0001
Related Items (48)
A problem of Füredi and Seymour on covering intersecting families by pairs ⋮ Colouring graphs with sparse neighbourhoods: bounds and applications ⋮ Concentration of non‐Lipschitz functions and applications ⋮ On the power of random greedy algorithms ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ The \(n\)-queens completion problem ⋮ List edge and list total colourings of multigraphs ⋮ Nearly perfect matchings in regular simple hypergraphs ⋮ Extension from precoloured sets of edges ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ The Ramsey number R(3, t) has order of magnitude t2/log t ⋮ List Ramsey numbers ⋮ The list linear arboricity of graphs ⋮ Asymptotically good edge correspondence colourings ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Edge-colouring graphs with local list sizes ⋮ Orthogonal Latin Rectangles ⋮ Computing the list chromatic index of graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ On the chromatic polynomial and counting DP-colorings of graphs ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ Chromatic-choosability of hypergraphs with high chromatic number ⋮ On the Choice Number of Packings ⋮ Precoloring extension. I: Interval graphs ⋮ New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help ⋮ Tight embeddings of partial quadrilateral packings ⋮ On a hypergraph matching problem ⋮ Near-optimal list colorings ⋮ List coloring of Cartesian products of graphs ⋮ Answers to two questions on the DP color function ⋮ Turán's theorem in sparse random graphs ⋮ Proof of the list edge coloring conjecture for complete graphs of prime degree ⋮ Acyclic edge colourings of graphs with large girth ⋮ Goldberg's conjecture is true for random multigraphs ⋮ Edge‐coloring linear hypergraphs with medium‐sized edges ⋮ Pseudorandom hypergraph matchings ⋮ Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions ⋮ A Proof of a Conjecture of Ohba ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative ⋮ Fractional decompositions of dense hypergraphs ⋮ Probabilistic methods in coloring and decomposition problems
This page was built for publication: Asymptotically good list-colorings
