A set and collection lemma

zbMath1300.05230arXiv1101.4564MaRDI QIDQ405128

Eugen Mandrescu, Vadim E. Levit

Publication date: 4 September 2014

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

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

zbMATH Keywords

coronamatchingstable setcoreindependent setclique

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

On some conjectures concerning critical independent sets of a graph ⋮ Two more characterizations of König-Egerváry graphs ⋮ Critical and maximum independent sets of a graph ⋮ Matchings in graphs and groups ⋮ Linear maps on nonnegative symmetric matrices preserving the independence number ⋮ On König-Egerváry collections of maximum critical independent sets ⋮ On the intersection of all critical sets of a unicyclic graph ⋮ Monotonic properties of collections of maximum independent sets of a graph ⋮ On an annihilation number conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of the graphs in which the transversal number equals the matching number
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• Combinatorial properties of the family of maximum stable sets of a graph
• Very well covered graphs
• On the number of vertices belonging to all maximum stable sets of a graph
• On \(\alpha\)-critical edges in König--Egerváry graphs
• On hitting all maximum cliques with an independent set
• Hitting all maximum cliques with a stable set using lopsided independent transversals
• A Note on Hitting Maximum and Maximal Cliques With a Stable Set
• A Theorem on k-Saturated Graphs

This page was built for publication: A set and collection lemma