Using Lagrangians of hypergraphs to find non-jumping numbers. II. (Q879390)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5151801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using Lagrangians of hypergraphs to find non-jumping numbers. II. |
scientific article; zbMATH DE number 5151801 |
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
0.9499242901802064
0 references
0.9118413925170898
0 references
0.9073353409767152
0 references
0.906801462173462
0 references
0.9052287340164183
0 references
