The following pages link to (Q4500691):
Displayed 17 items.
- Online containers for hypergraphs, with applications to linear equations (Q326815) (← links)
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings (Q466092) (← links)
- Hypergraph containers (Q496210) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- On DP-coloring of graphs and multigraphs (Q2360256) (← links)
- List coloring of Cartesian products of graphs (Q2501567) (← links)
- The asymptotic behavior of the correspondence chromatic number (Q2629278) (← links)
- Some new bounds on \(T_{r}\)-choosability (Q2643324) (← links)
- List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs (Q2811205) (← links)
- Lower bounds on coloring numbers from hardness hypotheses in pcf theory (Q2827384) (← links)
- List Colourings of Regular Hypergraphs (Q2883869) (← links)
- List Coloring with a Bounded Palette (Q2958200) (← links)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
- Circular choosability (Q3652533) (← links)
- Improper Choosability and Property B (Q5325946) (← links)