Linear hypergraphs with large transversal number and maximum degree two
From MaRDI portal
Recommendations
Cites work
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Covering all cliques of a graph
- Graph theory
- scientific article; zbMATH DE number 3232667 (Why is no real title available?)
- Hypergraphs with large transversal number
- Hypergraphs with large transversal number and with edge sizes at least 3
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
- Paths, Trees, and Flowers
- Perfect matchings of a graph
- Small transversals in hypergraphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Total domination of graphs and small transversals of hypergraphs
- Transversals and matchings in 3-uniform hypergraphs
Cited in
(31)- Domination in intersecting hypergraphs
- Extremal hypergraphs for matching number and domination number
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- A note on fractional disjoint transversals in hypergraphs
- Affine planes and transversals in 3-uniform linear hypergraphs
- A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size
- Transversals in linear uniform hypergraphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- On transversal numbers of intersecting straight line systems and intersecting segment systems
- Domination and matching in power and generalized power hypergraphs
- Transversals and independence in linear hypergraphs with maximum degree two
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
- Bounds on the game transversal number in hypergraphs
- Domination and total domination in hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total transversals and total domination in uniform hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least four
- A note on improved upper bounds on the transversal number of hypergraphs
- Transversals in 4-uniform linear hypergraphs
- A note on a problem of Henning and Yeo about the transversal number of uniform linear systems whose 2-packing number is fixed
- On transversal and 2-packing numbers in uniform linear systems
- Matching criticality in intersecting hypergraphs
- Total transversals in hypergraphs and their applications
- scientific article; zbMATH DE number 7666858 (Why is no real title available?)
- Maximal -critical linear hypergraphs
- On the transversal number of rank k hypergraphs
- On the transversal number of k-uniform connected hypergraphs
- An upper bound for the transversal number of connected k-uniform hypergraphs
- Transversal coalitions in hypergraphs
- A note on Tuza constant for the transversal number of intersecting uniform linear systems
This page was built for publication: Linear hypergraphs with large transversal number and maximum degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441629)
