Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice

DOI10.1016/j.disc.2021.112485zbMath1472.05050OpenAlexW3169731413MaRDI QIDQ2032907

Ajit A. Diwan

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112485

zbMATH Keywords

levelsedge-coloring1-factorizationdivisor lattice

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Structure theory of lattices (06B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Explicit matchings in the middle levels of the Boolean lattice
• Strong versions of Sperner's theorem
• An explicit 1-factorization in the middle of the Boolean lattice
• Proof of the middle levels conjecture
• A short proof of the middle levels theorem
• On 1-factorizations of bipartite Kneser graphs

This page was built for publication: Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice