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
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548311000496 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031135338 / rank | |||
Normal rank | |||
Latest revision as of 09:28, 30 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
