Complexes of graphs with bounded independence number

zbMath1447.05246arXiv1912.12605MaRDI QIDQ5918951

Alan Lew, Min-Ki Kim

Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

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

zbMATH Keywords

homologyrainbow independent sets\(d\)-collapsibility

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of simplicial complexes (05E45)

Related Items (4)

Rainbow independent sets on dense graph classes ⋮ A system of disjoint representatives of line segments with given \(k\) directions ⋮ Rainbow Odd Cycles ⋮ Complexes of graphs with bounded independence number

Cites Work

• Unnamed Item
• Extremal problems related to Betti numbers of flag complexes
• Rainbow matchings in bipartite multigraphs
• A topological colorful Helly theorem
• Dimension gaps between representability and collapsibility
• A simple proof of the upper bound theorem
• d-collapsing and nerves of families of convex sets
• Note on a combinatorial application of Alexander duality
• Rainbow fractional matchings
• Choice functions in the intersection of matroids
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• Large rainbow matchings in general graphs
• d-collapsibility is NP-complete for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>d</mml:mi><mml:mo>⩾</mml:mo><mml:mn>4</mml:mn></mml:math>

This page was built for publication: Complexes of graphs with bounded independence number