On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size (Q2883857): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees / 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: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / rank | |||
Normal rank | |||
Revision as of 05:32, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size |
scientific article |
Statements
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size (English)
0 references
14 May 2012
0 references
\(k\)-uniform hypergraph
0 references
