On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806): 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.1006/eujc.1999.0330 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978969142 / rank | |||
Normal rank |
Revision as of 21:12, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of edges in hypergraphs critical with respect to strong colourings |
scientific article |
Statements
On the number of edges in hypergraphs critical with respect to strong colourings (English)
0 references
29 June 2000
0 references
A colouring of the vertices of a hypergraph \(G\) is called strong if, for every edge \(A\), the colours of all vertices in \(A\) are distinct. In this paper the minimum number of edges possible in a \(k\)-splitting-critical \(t\)-uniform hypergraph with a given number of vertices is estimated. In particular it is shown that, for \(k\geq t+2\), the problem reduces in a way to the corresponding problem for graphs. In the case when the generated graph of the hypergraph has bounded clique number, a lower bound that is valid for sufficiently large \(k\) and is asymptotically tight in \(k\) is given; this bound also holds for list strong colourings.
0 references
splitting-critical \(t\)-uniform hypergraph
0 references
strong colouring
0 references
bounded clique number
0 references
list strong colouring
0 references