Pages that link to "Item:Q1906118"
From MaRDI portal
The following pages link to Asymptotically good list-colorings (Q1906118):
Displaying 50 items.
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Asymmetric list sizes in bipartite graphs (Q825958) (← links)
- Tight embeddings of partial quadrilateral packings (Q965225) (← links)
- List-colourings of graphs (Q1084403) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- A problem of Füredi and Seymour on covering intersecting families by pairs (Q1337172) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative (Q1587903) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Computing the list chromatic index of graphs (Q1711669) (← links)
- Asymptotically the list colouring constants are 1 (Q1850621) (← links)
- List coloring hypergraphs (Q1960283) (← links)
- Answers to two questions on the DP color function (Q2030743) (← links)
- Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867) (← links)
- On the power of random greedy algorithms (Q2145759) (← links)
- The \(n\)-queens completion problem (Q2157925) (← links)
- Packing nearly optimal Ramsey \(R(3,t)\) graphs (Q2182253) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
- Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- List coloring of Cartesian products of graphs (Q2501567) (← links)
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions (Q2565683) (← links)
- An asymptotic upper bound for the chromatic index of random hypergraphs (Q3225909) (← links)
- Fractional decompositions of dense hypergraphs (Q3429620) (← links)
- Orthogonal Latin Rectangles (Q3527541) (← links)
- Turán's theorem in sparse random graphs (Q4431433) (← links)
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484) (← links)
- Asymptotics of the list-chromatic index for multigraphs (Q4511485) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
- The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> (Q4851927) (← links)
- On the Choice Number of Packings (Q4906043) (← links)
- Acyclic edge colourings of graphs with large girth (Q4978429) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture (Q5138970) (← links)
- List colorings of multipartite hypergraphs (Q5216184) (← links)
- Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- List Ramsey numbers (Q6055384) (← links)
- The list linear arboricity of graphs (Q6056776) (← links)
