Linear hypergraphs with large transversal number and maximum degree two
From MaRDI portal
Publication:2441629
DOI10.1016/j.ejc.2013.07.016zbMath1284.05188OpenAlexW2089632810MaRDI QIDQ2441629
Michael A. Henning, Michael J. Dorfling
Publication date: 25 March 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.07.016
Related Items (22)
Transversals and independence in linear hypergraphs with maximum degree two ⋮ Domination in intersecting hypergraphs ⋮ Bounds on the game transversal number in hypergraphs ⋮ Total transversals and total domination in uniform hypergraphs ⋮ On the transversal number of rank \(k\) hypergraphs ⋮ On the transversal number of \(k\)-uniform connected hypergraphs ⋮ Extremal hypergraphs for matching number and domination number ⋮ 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 ⋮ On transversal numbers of intersecting straight line systems and intersecting segment systems ⋮ On transversal and 2-packing numbers in uniform linear systems ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ A note on fractional disjoint transversals in hypergraphs ⋮ On a problem of Henning and Yeo about the transversal number of uniform linear systems whose 2-packing number is fixed ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Affine planes and transversals in 3-uniform linear hypergraphs ⋮ Domination and Total Domination in Hypergraphs ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game ⋮ Matching criticality in intersecting hypergraphs ⋮ Total Transversals in Hypergraphs and Their Applications ⋮ A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
Cites Work
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- Transversals and matchings in 3-uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Hypergraphs with large transversal number
- Perfect matchings of a graph
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three
- Paths, Trees, and Flowers
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear hypergraphs with large transversal number and maximum degree two
