The following pages link to A Note on Vertex List Colouring (Q2757076):
Displaying 40 items.
- Asymmetric list sizes in bipartite graphs (Q825958) (← links)
- On finite simple groups and Kneser graphs. (Q968241) (← links)
- Bounded size components -- partitions and transversals. (Q1400964) (← links)
- Problems and results in extremal combinatorics. I. (Q1417566) (← links)
- Asymptotically the list colouring constants are 1 (Q1850621) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- Independent coverings and orthogonal colourings (Q2032848) (← links)
- Fair splittings by independent sets in sparse graphs (Q2182042) (← links)
- Cooperative colorings of trees and of bipartite graphs (Q2294110) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- The chromatic discrepancy of graphs (Q2341751) (← links)
- Cooperative colorings and independent systems of representatives (Q2346466) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- Sets of elements that pairwise generate a linear group (Q2426424) (← links)
- Independent systems of representatives in weighted graphs (Q2460628) (← links)
- An average degree condition for independent transversals (Q2668023) (← links)
- Cooperative colorings of forests (Q2684895) (← links)
- Bounded transversals in multipartite graphs (Q2897209) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- On hitting all maximum cliques with an independent set (Q3067059) (← links)
- An Improvement of the Lovász Local Lemma via Cluster Expansion (Q3103621) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- New bounds for the Moser‐Tardos distribution (Q5120743) (← links)
- Hitting all maximum cliques with a stable set using lopsided independent transversals (Q5199419) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- The list linear arboricity of graphs (Q6056776) (← links)
- When removing an independent set is optimal for reducing the chromatic number (Q6057453) (← links)
- A note on \(\Delta\)-critical graphs (Q6063276) (← links)
- Colorings, transversals, and local sparsity (Q6074708) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
- (Q6084349) (← links)
- Large cliques in graphs with high chromatic number (Q6091811) (← links)
- Graphs of low average degree without independent transversals (Q6093156) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- On the maximal number of elements pairwise generating the finite alternating group (Q6126166) (← links)
- On an \(f\)-coloring generalization of linear arboricity of multigraphs (Q6184546) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Packing list‐colorings (Q6185050) (← links)
