Finding any given 2‐factor in sparse pseudorandom graphs efficiently (Q6055382)
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: Finding any given 2‐factor in sparse pseudorandom graphs efficiently |
scientific article; zbMATH DE number 7743883
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding any given 2‐factor in sparse pseudorandom graphs efficiently |
scientific article; zbMATH DE number 7743883 |
Statements
Finding any given 2‐factor in sparse pseudorandom graphs efficiently (English)
0 references
29 September 2023
0 references
2-factors
0 references
absorbing meth
0 references
expander graphs
0 references
