Expansion properties of Whitehead moves on cubic graphs
The present note concerns the “graph of graphs” that has cubic graphs as vertices connected by edges represented by the so-called Whitehead moves. Here, we prove that the outer-conductance of the graph of graphs tends to zero as the number of vertices tends to infinity. This answers a question of K....
Saved in:
Main Authors: | Grave de Peralta, Laura, Kolpakov, Alexander |
---|---|
Format: | Article |
Language: | English |
Published: |
Académie des sciences
2024-11-01
|
Series: | Comptes Rendus. Mathématique |
Subjects: | |
Online Access: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.691/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Longest cycles in certain bipartite graphs
by: Pak-Ken Wong
Published: (1998-01-01) -
4-REGULAR GRAPH OF DIAMETER 2
by: Đỗ Như An, et al.
Published: (2013-06-01) -
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
by: Nhu An Do, et al.
Published: (2024-02-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01) -
Inverse neutrosophic mixed graphs
by: Thempaavai Jayaprakash, et al.
Published: (2024-07-01)