Odd Independent Transversals are Odd

DOI10.1017/S0963548305007157zbMATH Open1082.05068OpenAlexW2096125244MaRDI QIDQ3373664FDOQ3373664

Authors: Penny Haxell, Tibor Szabó 

Publication date: 13 March 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007157

Recommendations

• Independent transversals in \(r\)-partite graphs
• Independent Transversals in Sparse Partite Hypergraphs
• Independent transversals in locally sparse graphs
• On factors of independent transversals in \(k\)-partite graphs
• An average degree condition for independent transversals

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (14)

• Bounded transversals in multipartite graphs
• Constructing graphs with no independent transversals
• Balanced independent sets in graphs omitting large cliques
• Graphs of low average degree without independent transversals
• Independent transversals in locally sparse graphs
• Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
• Polynomial treewidth forces a large grid-like-minor
• Coloring Graphs with Dense Neighborhoods
• A Density Turán Theorem
• Complete subgraphs in a multipartite graph
• A universal partition result for infinite homogeneous \(K_n\)-free and related graphs
• Finding independent transversals efficiently
• On subgraphs of tripartite graphs
• An asymptotically sharp bound on the maximum number of independent transversals

This page was built for publication: Odd Independent Transversals are Odd

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373664)