Minimal abundant packings and choosability with separation

DOI10.1007/s10623-024-01484-wMaRDI QIDQ6651912

A. V. Kostochka, Z. Füredi, Mohit Kumbhat

Publication date: 11 December 2024

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

\(t\)-designscomplete graphchoosabilitygraph coloringslist coloringspacking of sets

Mathematics Subject Classification ID

Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New asymptotics for bipartite Turán numbers
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
• Bombieri's theorem in short intervals
• Brooks-type theorems for choosability with separation
• Separation Choosability and Dense Bipartite Induced Subgraphs
• Single‐conflict colouring

This page was built for publication: Minimal abundant packings and choosability with separation