hamiltonian cycles in triangulations
play

Hamiltonian Cycles in Triangulations Gunnar Brinkmann, Craig Larson, - PowerPoint PPT Presentation

Apr 10, 2023 •213 likes •668 views

Hamiltonian Cycles in Triangulations Gunnar Brinkmann, Craig Larson, Jasper Souffriau, Nico Van Cleemput Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer Science Ghent University G.

  1. Hamiltonian Cycles in Triangulations Gunnar Brinkmann, Craig Larson, Jasper Souffriau, Nico Van Cleemput Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer Science Ghent University G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  2. Triangulation A triangulation is a plane graph in which each face is a triangle. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  3. Hamiltonian cycle A hamiltonian cycle in G ( V , E ) is a subgraph of G ( V , E ) which is isomorphic to C | V | . A graph is hamiltonian if it contains a hamiltonian cycle. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  4. Separating triangles A separating triangle S in a triangulation T is a subgraph of T such that S is isomorphic to C 3 and T − S has two components. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  5. 4-connected triangulations A triangulation is 4-connected if and only if it contains no separating triangles. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  6. Whitney Theorem (Whitney, 1931) Each triangulation without separating triangles is hamiltonian. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  7. Splitting triangulations G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  8. Recursively splitting triangulations 4-connected parts G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  9. Decomposition tree Vertices: 4-connected parts Edges: separating triangles G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  10. Jackson and Yu Theorem (Jackson and Yu, 2002) A triangulation with a decomposition tree with maximum degree 3 is hamiltonian. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  11. Jackson and Yu There exists a non-hamiltonian triangulation with a decomposition tree with maximum degree 4. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  12. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  13. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  14. Question Can the result of Jackson and Yu be improved? Which trees can arise as decomposition trees of non-hamiltonian triangulations? G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  15. Jackson and Yu Theorem (Jackson and Yu, 2002) Let G be a 4-connected triangulation. Let T , T 1 , T 2 be distinct triangles in G. Let V ( T ) = { u , v , w } . Then there exists a hamiltonian cycle C of G and edges e 1 ∈ E ( T 1 ) and e 2 ∈ E ( T 2 ) such that uv, uw, e 1 and e 2 are distinct and contained in E ( C ) . G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  16. Subdividing a face with a graph G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  17. Subdividing a face with a graph G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  18. Subdividing a non-hamiltonian triangulation Lemma When a non-hamiltonian triangulation is subdivided, then the resulting graph is also non-hamiltonian. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  19. Creating a non-hamiltonian plane graph Lemma When in a plane graph with more faces than vertices each face is subdivided, then the resulting plane graph is non-hamiltonian. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  20. Decomposition trees with ∆ ≥ 6 Theorem For each tree D with ∆( D ) ≥ 6 , there exists a non-hamiltonian triangulation T, such that D is the decomposition tree of T. Constructive proof. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  21. Assume ∆( D ) = 6. D 1 D 2 D 3 D 4 D 5 D 6 Choose triangulation T i with decomposition tree D i (1 ≤ i ≤ 6) G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  22. T 4 T 5 T 6 T 1 T 3 T 2 A non-hamiltonian triangulation with D as decomposition tree. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  23. ∆( D ) > 6 · · · G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  24. Remaining cases Given a tree D : If ∆( D ) ≤ 3, then D is not the decomposition tree of a non-hamiltonian triangulation. If ∆( D ) ≥ 6, then D is the decomposition tree of a non-hamiltonian triangulation. What if ∆( D ) = 4 or ∆( D ) = 5? G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  25. Multiple degrees > 3 Theorem For each tree D with at least two vertices with degree > 3 , there exists a non-hamiltonian triangulation T, such that D is the decomposition tree of T. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  26. Adjacent vertices with degree > 3 8 faces and 7 vertices G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  27. Non-adjacent vertices with degree > 3 G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  28. Remaining cases: trees with one vertex of degree 4 or 5 and all other degrees at most 3. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  29. Simplifying things Theorem For each k ≥ 4 . Let D be a tree with one vertex of degree k and all other vertices of degree ≤ 3 . There exists a non-hamiltonian triangulation with D as decomposition tree if and only if there exists a non-hamiltonian triangulation with K 1 , k as decomposition tree. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  30. Simplifying things (more) Theorem For each k ≥ 4 . If there exists a non-hamiltonian triangulation with K 1 , k as decomposition tree, then there exists a non-hamiltonian triangulation with K 1 , k as decomposition tree such that the leaves correspond to K 4 ’s. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  31. Specialized search Specialised programs to search for non-hamiltonian triangulations with K 1 , 4 or K 1 , 5 as decomposition tree. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  32. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  33. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  34. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  35. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  36. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  37. Extending hamiltonian cycles Given a graph G and the graph G ′ which is constructed from G by subdividing 4 or 5 faces with a K 4 . When can a hamiltonian cycle of G be extended to a hamiltonian cycle of G ′ ? G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  38. Hamiltonian cycles and matchings edge is contained in triangle triangles of G edges of G G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  39. Hamiltonian cycles and matchings edge is contained in triangle triangles of G edges of G G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  40. Hamiltonian cycles and matchings edge is contained in triangle triangles of G edges of G G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  41. Limiting the 4-tuples Theorem Let G be a 4-connected triangulation. Let T 1 , T 2 , T 3 and T 4 be triangles in G such that at least two of them share an edge. The graph obtained by subdividing the four triangles with a K 4 is hamiltonian. ⇒ only check edge-disjoint 4-tuples of faces G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  42. Results All triangulations on at most 27 vertices with K 1 , 4 or K 1 , 5 as decomposition tree are hamiltonian. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  43. Results 4-connected V F triangulations 6 8 1 7 10 1 8 12 2 9 14 4 10 16 10 11 18 25 12 20 87 13 22 313 14 24 1357 15 26 30 926 16 28 158 428 17 30 836 749 18 32 4 504 607 19 34 24 649 284 20 36 136 610 879 21 38 765 598 927 22 40 4 332 047 595 23 42 24 724 362 117 G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

  44. Thanks for your attention. G. Brinkmann, C. Larson, J. Souffriau, N. Van Cleemput Hamiltonian Cycles in Triangulations

Recommend

On the number of hamiltonian cycles in triangulations with few separating triangles Gunnar

On the number of hamiltonian cycles in triangulations with few separating triangles Gunnar

Introduction Technique Results Future work On the number of hamiltonian cycles in triangulations with few separating triangles Gunnar Brinkmann Annelies Cuvelier Jasper Souffriau Nico Van Cleemput Combinatorial Algorithms and Algorithmic

1.05k views • 68 slides
Hamiltonian Triangulations and Triangle Strips: an overview Peter Palfrader University of

Hamiltonian Triangulations and Triangle Strips: an overview Peter Palfrader University of

Introduction Hamiltonian Triangulations Tristrip Decomposition Further Reading Hamiltonian Triangulations and Triangle Strips: an overview Peter Palfrader University of Salzburg February 2011 Introduction Hamiltonian Triangulations

608 views • 47 slides
4-Connected Polyhedra have a Linear Number of Hamiltonian Cycles Gunnar Brinkmann, Nico Van

4-Connected Polyhedra have a Linear Number of Hamiltonian Cycles Gunnar Brinkmann, Nico Van

4-Connected Polyhedra have a Linear Number of Hamiltonian Cycles Gunnar Brinkmann, Nico Van Cleemput Concerning hamiltonicity for plane triangulations and polyhedra the same results seem to hold though they can have much fewer edges . (Ratio:

595 views • 27 slides
Connections between decomposition trees of 3-connected plane triangulations and hamiltonian

Connections between decomposition trees of 3-connected plane triangulations and hamiltonian

Introduction Hamiltonicity Other hamiltonian properties Connections between decomposition trees of 3-connected plane triangulations and hamiltonian properties Gunnar Brinkmann Jasper Souffriau Nico Van Cleemput Ghent University G.

1.09k views • 53 slides
Hamiltonian Cycles Hamiltonian Cycles CSE, IIT KGP Hamiltonian Cycle Hamiltonian Cycle A A

Hamiltonian Cycles Hamiltonian Cycles CSE, IIT KGP Hamiltonian Cycle Hamiltonian Cycle A A

Hamiltonian Cycles Hamiltonian Cycles CSE, IIT KGP Hamiltonian Cycle Hamiltonian Cycle A A Hamiltonian cycle Hamiltonian cycle is a spanning cycle in a is a spanning cycle in a graph. graph. The c The c ircumference

276 views • 5 slides
Generalized Hamiltonian Cycles Jakub Teska School of ITMS University of Ballarat, VIC 3353,

Generalized Hamiltonian Cycles Jakub Teska School of ITMS University of Ballarat, VIC 3353,

Generalized Hamiltonian Cycles Jakub Teska School of ITMS University of Ballarat, VIC 3353, Australia Jakub Teska, October 2, 2006 Generalized Hamiltonian Cycles - p. 1/27 Hamiltonian cycle Hamiltonian cycle is a cycle in a graph which

820 views • 77 slides
Fault- -free Hamiltonian Cycles in Pancake free Hamiltonian Cycles in Pancake Fault Graphs with

Fault- -free Hamiltonian Cycles in Pancake free Hamiltonian Cycles in Pancake Fault Graphs with

Fault- -free Hamiltonian Cycles in Pancake free Hamiltonian Cycles in Pancake Fault Graphs with Conditional Edge Faults Graphs with Conditional Edge Faults ), Ying Tsai( Ping- Ping -Ying Tsai( ), ), Fu(

513 views • 39 slides
Polychromatic Colorings of Complete Graphs with Respect to 1-,2-factors and Hamiltonian Cycles

Polychromatic Colorings of Complete Graphs with Respect to 1-,2-factors and Hamiltonian Cycles

Polychromatic Colorings of Complete Graphs with Respect to 1-,2-factors and Hamiltonian Cycles Maria Axenovich John Goldwasser Ryan Hansen Bernard Lidick y Ryan R. Martin David Offner John Talbot Michael Young SIAM DM June 6, 2018

931 views • 57 slides
Table of Contents I Answer Set Programming ASP Solvers Example: Hamiltonian Cycles Choice Rules

Table of Contents I Answer Set Programming ASP Solvers Example: Hamiltonian Cycles Choice Rules

Table of Contents I Answer Set Programming ASP Solvers Example: Hamiltonian Cycles Choice Rules Solving Puzzles Yulia Kahl College of Charleston Artificial Intelligence 1 Reading Read Chapter 6, Answer-Set Programming Paradigm , in the

199 views • 15 slides
4-connected polyhedra have at least a linear number of hamiltonian cycles Gunnar Brinkmann Nico

4-connected polyhedra have at least a linear number of hamiltonian cycles Gunnar Brinkmann Nico

Introduction 4-connected polyhedra Few 3-cuts Summary 4-connected polyhedra have at least a linear number of hamiltonian cycles Gunnar Brinkmann Nico Van Cleemput Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied

474 views • 43 slides
4-connected polyhedra have at least a linear number of hamiltonian cycles Gunnar Brinkmann Nico

4-connected polyhedra have at least a linear number of hamiltonian cycles Gunnar Brinkmann Nico

Introduction 4-connected polyhedra Few 3-cuts Summary 4-connected polyhedra have at least a linear number of hamiltonian cycles Gunnar Brinkmann Nico Van Cleemput Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied

411 views • 15 slides
Randomness in Computing L ECTURE 19 Last time Finding Hamiltonian cycles in random graphs

Randomness in Computing L ECTURE 19 Last time Finding Hamiltonian cycles in random graphs

Randomness in Computing L ECTURE 19 Last time Finding Hamiltonian cycles in random graphs Today Probabilistic method 4/7/2020 Sofya Raskhodnikova;Randomness in Computing The probabilistic method To prove that an object with required

467 views • 17 slides
Finding many edge-disjoint Hamiltonian cycles in dense graphs Stephen G. Hartke Department of

Finding many edge-disjoint Hamiltonian cycles in dense graphs Stephen G. Hartke Department of

Finding many edge-disjoint Hamiltonian cycles in dense graphs Stephen G. Hartke Department of Mathematics University of NebraskaLincoln www.math.unl.edu/ shartke2 hartke@math.unl.edu Joint work with T yler Seacrest Finding Edge-Disj.

883 views • 50 slides
Building Good Triangulations 1. Nets and thick triangulations 2. Triangulation of manifolds

Building Good Triangulations 1. Nets and thick triangulations 2. Triangulation of manifolds

Building Good Triangulations 1. Nets and thick triangulations 2. Triangulation of manifolds Jean-Daniel Boissonnat INRIA Hamilton Mathematics Institute 17-19 June, 2018 1 / 58 Triangulations A central subject since the early days of

1.38k views • 76 slides
Hamiltonian Systems Hamiltonian Systems H ( p 1 , . . . p N , q 1 , . . . q N ) q i = H p i =

Hamiltonian Systems Hamiltonian Systems H ( p 1 , . . . p N , q 1 , . . . q N ) q i = H p i =

Laurette TUCKERMAN laurette@pmmh.espci.fr Hamiltonian Systems Hamiltonian Systems H ( p 1 , . . . p N , q 1 , . . . q N ) q i = H p i = H p i q i q i : positions p i : momenta convention for number of degrees of freedom:

594 views • 44 slides
Hamiltonian engineering for many-body quantum systems by Shortcuts To Adiabaticity Kazutaka

Hamiltonian engineering for many-body quantum systems by Shortcuts To Adiabaticity Kazutaka

Hamiltonian engineering for many-body quantum systems by Shortcuts To Adiabaticity Kazutaka Takahashi Tokyo Tech Trieste, August 23, 2016 01/23 Motivation: QA Target Hamiltonian Best driver Hamiltonian? Best schedule? Hamiltonian

461 views • 23 slides
Rainbow Hamilton cycles Po-Shen Loh Carnegie Mellon University Joint work with Alan Frieze

Rainbow Hamilton cycles Po-Shen Loh Carnegie Mellon University Joint work with Alan Frieze

Rainbow Hamilton cycles Po-Shen Loh Carnegie Mellon University Joint work with Alan Frieze Graphs Definition A cycle is Hamiltonian if it visits every vertex exactly once. Graphs Definition A cycle is Hamiltonian if it visits every vertex

785 views • 54 slides
Probability and Delaunay triangulations 1 Randomized algorithms for Delaunay triangulations

Probability and Delaunay triangulations 1 Randomized algorithms for Delaunay triangulations

Probability and Delaunay triangulations 1 Randomized algorithms for Delaunay triangulations Poisson Delaunay triangulation 2 - 1 Randomized algorithms for Delaunay triangulations Randomized backward analysis of binary trees Randomized

1.99k views • 121 slides
Flips in higher order Delaunay triangulations Elena Arseneva, Prosenjit Bose, Pilar Cano, and

Flips in higher order Delaunay triangulations Elena Arseneva, Prosenjit Bose, Pilar Cano, and

Flips in higher order Delaunay triangulations Elena Arseneva, Prosenjit Bose, Pilar Cano, and Rodrigo I. Silveira Delaunay triangulations Delaunay triangulations S Delaunay triangulations DT ( S ) Delaunay triangulations DT ( S ) Delaunay

935 views • 64 slides
Ruijsenaars-Schneider system from reduction Quasi- quasi-Hamiltonian reduction Hamiltonian

Ruijsenaars-Schneider system from reduction Quasi- quasi-Hamiltonian reduction Hamiltonian

Marsden- Weinstein Ruijsenaars-Schneider system from reduction Quasi- quasi-Hamiltonian reduction Hamiltonian reduction Classification of compact integrable Timo Kluck systems Larger coupling Mathematisch Instituut, Universiteit

660 views • 62 slides
Quantization of Poisson-Lie Hamiltonian systems Chiara Esposito Julius Maximilian University of

Quantization of Poisson-Lie Hamiltonian systems Chiara Esposito Julius Maximilian University of

Hamiltonian actions Quantization Quantization of Poisson-Lie Hamiltonian systems Chiara Esposito Julius Maximilian University of W urzburg August 22, 2014 1 / 15 Hamiltonian actions Quantization Outline Hamiltonian actions Hamiltonian

759 views • 21 slides
Packing tight Hamilton cycles Po-Shen Loh Carnegie Mellon University Joint work with Alan Frieze

Packing tight Hamilton cycles Po-Shen Loh Carnegie Mellon University Joint work with Alan Frieze

Packing tight Hamilton cycles Po-Shen Loh Carnegie Mellon University Joint work with Alan Frieze and Michael Krivelevich General graphs Definition A cycle is Hamiltonian if it visits every vertex exactly once. (Dirac 52.) Degrees n 2

1.14k views • 74 slides
Triangulations Of Polytopes and Algebraic Geometry Francisco Santos Universidad de Cantabria,

Triangulations Of Polytopes and Algebraic Geometry Francisco Santos Universidad de Cantabria,

Triangulations Of Polytopes and Algebraic Geometry Francisco Santos Universidad de Cantabria, Santander, SPAIN http://personales.unican.es/santosf Anogia, August 25 2005 Outline of the talk 1. Triangulations of polytopes (a brief overview).

1.21k views • 120 slides
Counting Polygon Triangulations is Hard David Eppstein University of California, Irvine

Counting Polygon Triangulations is Hard David Eppstein University of California, Irvine

Counting Polygon Triangulations is Hard David Eppstein University of California, Irvine Symposium on Computational Geometry, June 2019 WARNING This is all just a gadget-based reduction. There are no new ideas. Triangulations of n convex points

778 views • 34 slides

More recommend