The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3
From MaRDI portal
Publication:2825489
DOI10.1002/jgt.21993zbMath1346.05200OpenAlexW1825821205MaRDI QIDQ2825489
Michael A. Henning, Christian Löwenstein
Publication date: 13 October 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21993
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- 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
- 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
- Small transversals in hypergraphs
- Independence numbers of hypergraphs with sparse neighborhoods.
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- 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
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
- Independent sets in triangle-free cubic planar graphs
- Independence, odd girth, and average degree
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraph domination and strong independence
- The potential of greed for independence
- Size and independence in triangle‐free graphs with maximum degree three
- On independent sets in hypergraphs
- A Theorem on Coloring the Lines of a Network
This page was built for publication: The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3
