The Minimum Number of Edges in Uniform Hypergraphs with Property O (Q3177361): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1608.06621 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On 3-chromatic hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on random greedy coloring of uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4088856 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Probabilistic Graph-Theoretical Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring n-sets red and blue / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2964266744 / rank | |||
Normal rank |
Latest revision as of 08:34, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Minimum Number of Edges in Uniform Hypergraphs with Property O |
scientific article |
Statements
The Minimum Number of Edges in Uniform Hypergraphs with Property O (English)
0 references
24 July 2018
0 references
oriented \(k\)-uniform hypergraph
0 references