The largest transversal numbers of uniform hypergraphs
From MaRDI portal
If \(H\) is an \(r\)-uniform hypergraph of order \(p\) without \((r+ 1)\)-cliques, then the transversal number of \(H\) has an upper bound in terms of \(c= p- 2r\). As corollaries of this result, lower bounds for the largest order of \(r\)-uniform hypergraphs with specified transversal number and for the stability number of triangle-free graphs are given.
Recommendations
Cites work
- A note on the independence number of triangle-free graphs. II
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Critical hypergraphs and interesting set-pair systems
- GENERALIZATIONS OF A LEMMA OF FOLKMAN
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3733982 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3482392 (Why is no real title available?)
- scientific article; zbMATH DE number 3596866 (Why is no real title available?)
- scientific article; zbMATH DE number 568855 (Why is no real title available?)
- Lower bounds on the independence number in terms of the degrees
- Size and independence in triangle‐free graphs with maximum degree three
- Upper bound on the order of tau-critical hypergraphs
Cited in
(6)- Transversals in uniform hypergraphs with property \((p,2)\)
- Hypergraphs with large transversal number
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total transversals and total domination in uniform hypergraphs
- scientific article; zbMATH DE number 1839818 (Why is no real title available?)
- Hypergraph families with bounded edge cover or transversal number
This page was built for publication: The largest transversal numbers of uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910524)
