A short proof of Erdős' conjecture for triple systems (Q1701428): Difference between revisions

@@ Property / author @@
-Andrzej Ruciński
@@ Property / author: Andrzej Ruciński / rank @@
-Normal rank
@@ Property / author @@
+Andrzej Ruciński
@@ Property / author: Andrzej Ruciński / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2513784308
@@ Property / OpenAlex ID: W2513784308 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q123263365
@@ Property / Wikidata QID: Q123263365 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00530
@@ Property / arXiv ID: 1609.00530 / 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 @@
+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 @@
+On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
+Normal rank
@@ Property / cites work @@
+On Erdős' extremal problem on matchings in hypergraphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1701428