New bounds for a hypergraph bipartite Turán problem (Q2194765): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcta.2020.105299 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3044057315 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1902.10258 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On coloring graphs to maximize the proportion of multicolored k-edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypergraphs in which all disjoint pairs have distinct unions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5512796 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3089368 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A hypergraph extension of the bipartite Turán problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum size of hypergraphs without generalized 4-cycles / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCTA.2020.105299 / rank | |||
Normal rank | |||
Latest revision as of 10:37, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New bounds for a hypergraph bipartite Turán problem |
scientific article |
Statements
New bounds for a hypergraph bipartite Turán problem (English)
0 references
7 September 2020
0 references
hypergraph Turán problem
0 references
bipartite Turán
0 references
degenerate problem
0 references
extremal hypergraphs
0 references
