Using Lagrangians of hypergraphs to find non-jumping numbers. II. (Q879390): 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.1016/j.disc.2006.09.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059144225 / rank | |||
Normal rank | |||
Revision as of 21:27, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using Lagrangians of hypergraphs to find non-jumping numbers. II. |
scientific article |
Statements
Using Lagrangians of hypergraphs to find non-jumping numbers. II. (English)
0 references
11 May 2007
0 references
Erdős jumping constant conjecture
0 references
Lagrangian of an \(r\)-uniform graph
0 references
optimal vector
0 references
