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
-
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) -
Introduction to graph theory /
by: West, Douglas Brent
Published: (2018) -
Edge-level multi-constranint graph pattern matching with lung cancer knowledge graph
by: Houdie Tu, et al.
Published: (2025-02-01) -
Research on Parameter-Efficient Knowledge Graph Completion Methods and Their Performance in the Cybersecurity Field
by: Bin Chen, et al.
Published: (2025-01-01) -
𝕮-inverse of graphs and mixed graphs
by: Alomari Omar, et al.
Published: (2025-02-01)