Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps (Q411650)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps |
scientific article; zbMATH DE number 6028997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps |
scientific article; zbMATH DE number 6028997 |
Statements
Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps (English)
0 references
30 April 2012
0 references
graphic list
0 references
graphic sequence
0 references
Erdős
0 references
gallai inequalities
0 references
aigner
0 references
triesch method
0 references
dominance order
0 references
integer partition
0 references
0.8582916259765625
0 references
0.795846164226532
0 references
0.7730334997177124
0 references
0.7650992274284363
0 references
0.7545145153999329
0 references
