Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963651820
@@ Property / OpenAlex ID: W2963651820 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06126
@@ Property / arXiv ID: 1607.06126 / rank @@
+Normal rank
@@ Property / cites work @@
+Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
+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 @@
+Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
+Normal rank
@@ Property / cites work @@
+Q5510578
@@ Property / cites work: Q5510578 / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal paths and circuits of graphs
@@ Property / cites work: On maximal paths and circuits of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
@@ Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank @@
+Normal rank
@@ Property / cites work @@
+Q3770569
@@ Property / cites work: Q3770569 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds for Erdős' matching conjecture
@@ Property / cites work: Improved bounds for Erdős' matching conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of edges in a hypergraph with given matching number
+Normal rank
@@ Property / cites work @@
+Families with no s pairwise disjoint sets
@@ Property / cites work: Families with no s pairwise disjoint sets / rank @@
+Normal rank
@@ Property / cites work @@
+Families with no matchings of size \(s\)
@@ Property / cites work: Families with no matchings of size \(s\) / rank @@
+Normal rank
@@ Property / cites work @@
+New inequalities for families without \(k\) pairwise disjoint members
+Normal rank
@@ Property / cites work @@
+Families of sets with no matchings of sizes 3 and 4
+Normal rank
@@ Property / cites work @@
+Partition‐free families of sets
@@ Property / cites work: Partition‐free families of sets / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős matching conjecture and concentration inequalities
+Normal rank
@@ Property / cites work @@
+On matchings in hypergraphs
@@ Property / cites work: On matchings in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
+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
@@ Property / cites work @@
+The junta method in extremal hypergraph theory and Chvátal's conjecture
+Normal rank
@@ Property / cites work @@
+Maximal number of subsets of a finite set No k of which are pairwise disjoint
+Normal rank
@@ Property / cites work @@
+The structure of large intersecting families
@@ Property / cites work: The structure of large intersecting families / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
+Normal rank
@@ Property / cites work @@
+Regular bipartite graphs and intersecting families
+Normal rank
@@ Property / cites work @@
+On Erdős' extremal problem on matchings in hypergraphs
+Normal rank
@@ Property / cites work @@
+Anti-Ramsey number of matchings in hypergraphs
@@ Property / cites work: Anti-Ramsey number of matchings in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recent advances on Dirac-type problems for hypergraphs
+Normal rank