Graphs of low average degree without independent transversals

DOI10.1002/jgt.22876zbMath1522.05491arXiv2106.15175OpenAlexW3174289135MaRDI QIDQ6093156

Tomáš Kaiser, Matthew Wales, Unnamed Author, Carla Groenland

Publication date: 6 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.15175

zbMATH Keywords

hypergraphcounterexampleaverage degreeindependent transversalmaximum block average degree

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Vertex degrees (05C07)

Cites Work

• Polynomial treewidth forces a large grid-like-minor
• Extremal problems for transversals in graphs with bounded degree
• The clique complex and hypergraph matching
• The linear arboricity of graphs
• On complete subgraphs of \(r\)-chromatic graphs
• Probabilistic methods in coloring and decomposition problems
• Independent transversals in \(r\)-partite graphs
• Domination numbers and homology
• Problems and results in extremal combinatorics. I.
• Another approach to non-repetitive colorings of graphs of bounded degree
• The local cut lemma
• Independent transversals in locally sparse graphs
• Independent systems of representatives in weighted graphs
• An average degree condition for independent transversals
• A Note on Vertex List Colouring
• Odd Independent Transversals are Odd
• The intersection of a matroid and a simplicial complex
• An improved bound for the strong chromatic number
• Complete Subgraphs of r-partite Graphs
• Hall's theorem for hypergraphs
• Transversals of Vertex Partitions in Graphs
• Single‐conflict colouring
• Colorings, transversals, and local sparsity

This page was built for publication: Graphs of low average degree without independent transversals