On a sparse random graph with minimum degree three: likely Pósa sets are large (Q376545)
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: On a sparse random graph with minimum degree three: likely Pósa sets are large |
scientific article; zbMATH DE number 6222540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a sparse random graph with minimum degree three: likely Pósa sets are large |
scientific article; zbMATH DE number 6222540 |
Statements
On a sparse random graph with minimum degree three: likely Pósa sets are large (English)
0 references
5 November 2013
0 references
sparse graphs
0 references
degrees
0 references
longest path
0 references
Pósa sets
0 references
Pósa rotations
0 references
0.8091894388198853
0 references
0.8026992678642273
0 references
0.7847561836242676
0 references
0.7762797474861145
0 references
0.7761380672454834
0 references
