Red-blue clique partitions and \((1-1)\)-transversals

zbMath1344.05106arXiv1509.03408MaRDI QIDQ311567

Alfréd Gyárfás, Jenő Lehel

Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\((1-1)\)-transversalred-blue clique cover

Mathematics Subject Classification ID

Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Intersection properties of families of convex \((n,d)\)-bodies
• Transversals of \(d\)-intervals
• Piercing \(d\)-intervals
• Transversals of 2-intervals, a topological approach
• Covering a hypergraph of subgraphs
• Cliques in the union of graphs
• KKM -- a topological approach for trees
• Lower bounds on the transversal numbers of \(d\)-intervals

This page was built for publication: Red-blue clique partitions and \((1-1)\)-transversals