Proof of the list edge coloring conjecture for complete graphs of prime degree
From MaRDI portal
Publication:743657
zbMath1301.05135MaRDI QIDQ743657
Publication date: 30 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i3p43
Combinatorial identities, bijective combinatorics (05A19) Games involving graphs (91A43) Algebraic combinatorics (05E99) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Group actions on combinatorial structures (05E18)
Related Items (14)
The tournament scheduling problem with absences ⋮ Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices ⋮ Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices ⋮ Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ On the Alon-Tarsi number of semi-strong product of graphs ⋮ Edge-colouring graphs with local list sizes ⋮ Computing the list chromatic index of graphs ⋮ Unnamed Item ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ Handling fairness issues in time-relaxed tournaments with availability constraints ⋮ The Alon-Tarsi conjecture: a perspective on the main results ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of polynomial method to on-line list colouring of graphs
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- Brooks' theorem via the Alon-Tarsi theorem
- Critically paintable, choosable or colorable graphs
- Zero-sum problems for abelian \(p\)-groups and covers of the integers by residue classes
- A lemma on polynomials modulo \(p^m\) and applications to coding theory
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- On the dispersions of the polynomial maps over finite fields
- On the number of even and odd Latin squares of order \(p+1\)
- Diagonally cyclic Latin squares.
- Asymptotically good list-colorings
- Classification of polynomial mappings between commutative groups.
- On-line list colouring of graphs
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- The list-chromatic index of \(K_6\)
- List edge colourings of some 1-factorable multigraphs
- Hownotto prove the Alon-Tarsi conjecture
- Combinatorial Nullstellensatz
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
This page was built for publication: Proof of the list edge coloring conjecture for complete graphs of prime degree
