A sufficient condition for graphic sequences with given largest and smallest entries, length, and sum (Q4560249)
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: A sufficient condition for graphic sequences with given largest and smallest entries, length, and sum |
scientific article; zbMATH DE number 6991647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for graphic sequences with given largest and smallest entries, length, and sum |
scientific article; zbMATH DE number 6991647 |
Statements
10 December 2018
0 references
degree sequence
0 references
graphic sequences
0 references
Erdős-Gallai theorem
0 references
graphicness
0 references
math.CO
0 references
0.8582916259765625
0 references
0.7923112511634827
0 references
0.7908967137336731
0 references
0.7793225049972534
0 references
