The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 (Q2825489): Difference between revisions

@@ Property / author @@
-Christian Löwenstein
@@ Property / author: Christian Löwenstein / rank @@
-Normal rank
@@ Property / author @@
+Christian Löwenstein
@@ Property / author: Christian Löwenstein / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.21993
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.21993 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1825821205
@@ Property / OpenAlex ID: W1825821205 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the edge cover number and independence number in hypergraphs
+Normal rank
@@ Property / cites work @@
+The potential of greed for independence
@@ Property / cites work: The potential of greed for independence / rank @@
+Normal rank
@@ Property / cites work @@
+Small transversals in hypergraphs
@@ Property / cites work: Small transversals in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matchings and transversals in hypergraphs, domination and independence in trees
+Normal rank
@@ Property / cites work @@
+Q3872499
@@ Property / cites work: Q3872499 / rank @@
+Normal rank
@@ Property / cites work @@
+Independence, clique size and maximum degree
@@ Property / cites work: Independence, clique size and maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets in bounded-degree hypergraphs
@@ Property / cites work: Independent sets in bounded-degree hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound on independence in terms of degrees
@@ Property / cites work: A lower bound on independence in terms of degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Independence in connected graphs
@@ Property / cites work: Independence in connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets in triangle-free cubic planar graphs
+Normal rank
@@ Property / cites work @@
+A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
+Normal rank
@@ Property / cites work @@
+Independent sets and matchings in subcubic graphs
@@ Property / cites work: Independent sets and matchings in subcubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
+Normal rank
@@ Property / cites work @@
+Hypergraphs with large transversal number and with edge sizes at least 3
+Normal rank
@@ Property / cites work @@
+Independence in graphs with maximum degree four
@@ Property / cites work: Independence in graphs with maximum degree four / rank @@
+Normal rank
@@ Property / cites work @@
+Size and independence in triangle‐free graphs with maximum degree three
+Normal rank
@@ Property / cites work @@
+Hypergraph domination and strong independence
@@ Property / cites work: Hypergraph domination and strong independence / rank @@
+Normal rank
@@ Property / cites work @@
+On independent sets in hypergraphs
@@ Property / cites work: On independent sets in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for the transversal numbers of 4-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Independence, odd girth, and average degree
@@ Property / cites work: Independence, odd girth, and average degree / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Coloring the Lines of a Network
@@ Property / cites work: A Theorem on Coloring the Lines of a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Total domination of graphs and small transversals of hypergraphs
+Normal rank
@@ Property / cites work @@
+Independence numbers of hypergraphs with sparse neighborhoods.
+Normal rank