Smallest 3-graphs having a 3-colored edge in every k-coloring (Q1258312): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:24, 31 January 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
