Transversals and independence in linear hypergraphs with maximum degree two

zbMath1366.05076MaRDI QIDQ2363113

Anders Yeo, Michael A. Henning

Publication date: 13 July 2017

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p50

zbMATH Keywords

hypergraphtransversallinear hypergraphstrong independence

Mathematics Subject Classification ID

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

Related Items

Unnamed Item ⋮ A note on improved upper bounds on the transversal number of hypergraphs ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs

Cites Work

• A new lower bound on the independence number of a graph and applications
• Independent sets and matchings in subcubic graphs
• A lower bound on independence in terms of degrees
• Matchings and transversals in hypergraphs, domination and independence in trees
• Independence in connected graphs
• Transversals and domination in uniform hypergraphs
• Independence in graphs with maximum degree four
• Total domination of graphs and small transversals of hypergraphs
• Independent sets in bounded-degree hypergraphs
• Independence, clique size and maximum degree
• Matching theory
• Small transversals in hypergraphs
• Independence numbers of hypergraphs with sparse neighborhoods.
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• New approach to the \(k\)-independence number of a graph
• A note on the edge cover number and independence number in hypergraphs
• A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
• Linear hypergraphs with large transversal number and maximum degree two
• Independent sets in triangle-free cubic planar graphs
• The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3
• Independence, odd girth, and average degree
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Hypergraphs with large transversal number and with edge sizes at least 3
• Hypergraph domination and strong independence
• Tight lower bounds on the matching number in a graph with given maximum degree
• The potential of greed for independence
• Size and independence in triangle‐free graphs with maximum degree three
• On independent sets in hypergraphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS