Alon-Tarsi for hypergraphs
From MaRDI portal
Cites work
- A nowhere-zero point in linear mappings
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- A short proof of combinatorial Nullstellensatz
- A solution to the 1-2-3 conjecture
- Chromatic-choosability of hypergraphs with high chromatic number
- Colorings and orientations of graphs
- Colorings versus list colorings of uniform hypergraphs
- Combinatorial Nullstellensatz
- Dense uniform hypergraphs have high list chromatic number
- Every nice graph is (1,5)-choosable
- Every planar graph is 5-choosable
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- Graph polynomials and paintability of plane graphs
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- Hypergraph extension of the Alon-Tarsi list coloring theorem
- Hypergraph list coloring and Euclidean Ramsey theory
- List coloring hypergraphs
- List colorings of multipartite hypergraphs
- List colourings of regular hypergraphs
- Matrix choosability
- Mr. Paint and Mrs. Correct
- On list coloring Steiner triple systems
- On two generalizations of the Alon-Tarsi polynomial method
- The Alon-Tarsi number of planar graphs
- The permanent rank of a matrix
- The probabilistic method
- Weight choosability of graphs
This page was built for publication: Alon-Tarsi for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364520)
