Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three
From MaRDI portal
Publication:4908832
DOI10.1002/jgt.21640zbMath1262.05111MaRDI QIDQ4908832
Michael A. Henning, Anders Yeo
Publication date: 7 March 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21640
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
On the transversal number of rank \(k\) hypergraphs, On the transversal number of \(k\)-uniform connected hypergraphs, On vertex independence number of uniform hypergraphs, A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size, Linear hypergraphs with large transversal number and maximum degree two
Uses Software
Cites Work
- Independence in graphs with maximum degree four
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Independence, clique size and maximum degree
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
- Tight lower bounds on the size of a maximum matching in a regular graph
- Independent sets in triangle-free cubic planar graphs
- Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
- Hypergraph domination and strong independence
- Size and independence in triangle‐free graphs with maximum degree three
- Decompositions of complete graphs into triangles and Hamilton cycles
