DISJOINT <i>r</i>-TUPLES IN AN <i>r</i>-GRAPH WITH GIVEN MAXIMUM DEGREE (Q3331252): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/qmath/34.4.423 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021871548 / rank | |||
Normal rank | |||
Latest revision as of 02:02, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DISJOINT <i>r</i>-TUPLES IN AN <i>r</i>-GRAPH WITH GIVEN MAXIMUM DEGREE |
scientific article |
Statements
DISJOINT <i>r</i>-TUPLES IN AN <i>r</i>-GRAPH WITH GIVEN MAXIMUM DEGREE (English)
0 references
1983
0 references
uniform hypergraph
0 references
maximum degree
0 references
