Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (Q2234788)
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 7411499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs |
scientific article; zbMATH DE number 7411499 |
Statements
Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (English)
0 references
19 October 2021
0 references
path factor
0 references
binding number
0 references
\(P_{\geq k}\)-factor uniform graph
0 references
combinatorial problems
0 references
0 references
0 references
0.8861976861953735
0 references
0.8782204985618591
0 references
0.8609997630119324
0 references
0.8495842218399048
0 references
0.8153234124183655
0 references
