A short proof of Erdős' conjecture for triple systems (Q1701428): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123263365, #quickstatements; #temporary_batch_1712272666262 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1609.00530 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved bounds for Erdős' matching conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the maximum number of edges in a hypergraph with given matching number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Erdős' extremal problem on matchings in hypergraphs / rank | |||
Normal rank | |||
Latest revision as of 04:53, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of Erdős' conjecture for triple systems |
scientific article |
Statements
A short proof of Erdős' conjecture for triple systems (English)
0 references
22 February 2018
0 references
\(3\)-uniform hypergraph
0 references
matching
0 references
0 references
