Smallest 3-graphs having a 3-colored edge in every k-coloring (Q1258312)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Smallest 3-graphs having a 3-colored edge in every k-coloring |
scientific article; zbMATH DE number 3634299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smallest 3-graphs having a 3-colored edge in every k-coloring |
scientific article; zbMATH DE number 3634299 |
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
