Sparse colour-critical hypergraphs (Q809089): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q30039725, #quickstatements; #temporary_batch_1704809102140 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sparse colour-critical hypergraphs |
scientific article |
Statements
Sparse colour-critical hypergraphs (English)
0 references
1989
0 references
A hypergraph H is called an n-hypergraph if the order of each of its edges equals n. It is called s-critical with respect to colouring if its chromatic number is r and the removal of any edge results in a graph which has chromatic number r-1. A hypergraph is called linear if the intersection of two arbitrary edges is at most 1 vertex. The main question treated in this paper is how few edges on (m,n,r)-graph or linear (m,n,r)-graph may possess. Estimates for the least numbers of that kind are given.
0 references
hypergraph
0 references
chromatic number
0 references
linear
0 references