On Erdős' extremal problem on matchings in hypergraphs (Q2439573): Difference between revisions

@@ Property / arXiv ID @@
+.4196
@@ Property / arXiv ID: 1202.4196 / rank @@
+Normal rank
@@ Property / cites work @@
+SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
@@ Property / cites work: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / rank @@
+Normal rank
@@ Property / cites work @@
+Q5510578
@@ Property / cites work: Q5510578 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3770569
@@ Property / cites work: Q3770569 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of edges in a hypergraph with given matching number
+Normal rank
@@ Property / cites work @@
+On matchings in hypergraphs
@@ Property / cites work: On matchings in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
+Normal rank
@@ Property / cites work @@
+The Size of a Hypergraph and its Matching Number
@@ Property / cites work: The Size of a Hypergraph and its Matching Number / rank @@
+Normal rank