Smallest 3-graphs having a 3-colored edge in every k-coloring (Q1258312): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5615282 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4063192 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A problem on triples / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4168938 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Un Probleme De Coloration Aux Aspects Varies / rank | |||
Normal rank | |||
Latest revision as of 02:25, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smallest 3-graphs having a 3-colored edge in every k-coloring |
scientific article |
Statements
Smallest 3-graphs having a 3-colored edge in every k-coloring (English)
0 references
1979
0 references
Hypergraphs
0 references
Colorings
0 references
Extremal Problems
0 references
3-Graph
0 references
