Every minor-closed property of sparse graphs is testable (Q962147)
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: Every minor-closed property of sparse graphs is testable |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every minor-closed property of sparse graphs is testable |
scientific article |
Statements
Every minor-closed property of sparse graphs is testable (English)
0 references
6 April 2010
0 references
minor closed
0 references
property testing
0 references
sparse graphs
0 references
hyper finite
0 references
0 references
0.8610525727272034
0 references
0.8504680395126343
0 references
0.8459259271621704
0 references
0.8180659413337708
0 references
