crossing numbers of beyond planar graphs
play

Crossing Numbers of Beyond-Planar Graphs Philipp Kindermann - PowerPoint PPT Presentation

Jul 03, 2023 •179 likes •928 views

Crossing Numbers of Beyond-Planar Graphs Philipp Kindermann Universit at W urzburg joint work with Markus Chimani Fabrizio Montecchiani Pavel Valtr Crossing ratio Crossing number cr ( G ) : Min. # crossings over all drawings of G

  1. Crossing Numbers of Beyond-Planar Graphs Philipp Kindermann Universit¨ at W¨ urzburg joint work with Markus Chimani Fabrizio Montecchiani Pavel Valtr

  2. Crossing ratio Crossing number cr ( G ) : Min. # crossings over all drawings of G

  3. Crossing ratio Crossing number cr ( G ) : 1-planar cr. number cr 1-pl ( G ) : Min. # crossings over Min. # crossings over all drawings of G all 1-planar drawings of G ? � ✗ ✗ ✗

  4. Crossing ratio Crossing number cr ( G ) : 1-planar cr. number cr 1-pl ( G ) : Min. # crossings over Min. # crossings over all drawings of G all 1-planar drawings of G ? � ✗ ✗ ✗ Fan-planar cr. number cr fan ( G ) : Min. # crossings over all fan-planar drawings of G � � ✗ ✗

  5. Crossing ratio Crossing number cr ( G ) : 1-planar cr. number cr 1-pl ( G ) : Min. # crossings over Min. # crossings over all drawings of G all 1-planar drawings of G ? � ✗ ✗ ✗ Fan-planar cr. number cr fan ( G ) : ( k -)quasi-planar cr. number cr ( k -)qp ( G ) : Min. # crossings over Min. # crossings over all fan-planar drawings of G all ( k -)quasi-planar drawings of G � � � � � ✗ ✗ ✗

  6. Crossing ratio Crossing number cr ( G ) : 1-planar cr. number cr 1-pl ( G ) : Min. # crossings over Min. # crossings over all drawings of G all 1-planar drawings of G ? � ✗ ✗ ✗ Fan-planar cr. number cr fan ( G ) : ( k -)quasi-planar cr. number cr ( k -)qp ( G ) : Min. # crossings over Min. # crossings over all fan-planar drawings of G all ( k -)quasi-planar drawings of G � � � � � ✗ ✗ ✗

  7. Crossing ratio Crossing number cr ( G ) : 1-planar cr. number cr 1-pl ( G ) : Min. # crossings over Min. # crossings over all drawings of G all 1-planar drawings of G ? � ✗ ✗ ✗ Fan-planar cr. number cr fan ( G ) : ( k -)quasi-planar cr. number cr ( k -)qp ( G ) : Min. # crossings over Min. # crossings over all fan-planar drawings of G all ( k -)quasi-planar drawings of G � � � � � ✗ ✗ ✗ Crossing ratio:

  8. Crossing ratio Crossing number cr ( G ) : 1-planar cr. number cr 1-pl ( G ) : Min. # crossings over Min. # crossings over all drawings of G all 1-planar drawings of G ? � ✗ ✗ ✗ Fan-planar cr. number cr fan ( G ) : ( k -)quasi-planar cr. number cr ( k -)qp ( G ) : Min. # crossings over Min. # crossings over all fan-planar drawings of G all ( k -)quasi-planar drawings of G � � � � � ✗ ✗ ✗ Crossing ratio: ̺ 1-pl ( G ) : supremum of cr 1-pl ( G ) /cr ( G ) over all 1-planar graphs

  9. Crossing ratio Crossing number cr ( G ) : 1-planar cr. number cr 1-pl ( G ) : Min. # crossings over Min. # crossings over all drawings of G all 1-planar drawings of G ? � ✗ ✗ ✗ Fan-planar cr. number cr fan ( G ) : ( k -)quasi-planar cr. number cr ( k -)qp ( G ) : Min. # crossings over Min. # crossings over all fan-planar drawings of G all ( k -)quasi-planar drawings of G � � � � � ✗ ✗ ✗ Crossing ratio: ̺ 1-pl ( G ) : supremum of cr 1-pl ( G ) /cr ( G ) over all 1-planar graphs ̺ fan ( G ) cr fan ( G ) /cr ( G ) fan-planar

  10. Crossing ratio Crossing number cr ( G ) : 1-planar cr. number cr 1-pl ( G ) : Min. # crossings over Min. # crossings over all drawings of G all 1-planar drawings of G ? � ✗ ✗ ✗ Fan-planar cr. number cr fan ( G ) : ( k -)quasi-planar cr. number cr ( k -)qp ( G ) : Min. # crossings over Min. # crossings over all fan-planar drawings of G all ( k -)quasi-planar drawings of G � � � � � ✗ ✗ ✗ Crossing ratio: ̺ 1-pl ( G ) : supremum of cr 1-pl ( G ) /cr ( G ) over all 1-planar graphs ̺ fan ( G ) cr fan ( G ) /cr ( G ) fan-planar ̺ ( k -)qp ( G ) cr ( k -)qp ( G ) /cr ( G ) ( k -)quasi-planar

  11. 1-Planar Graphs at most 4 n − 8 edges, n − 2 crossings

  12. 1-Planar Graphs at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1

  13. 1-Planar Graphs at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Graph G

  14. 1-Planar Graphs at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Graph G

  15. 1-Planar Graphs at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Graph G

  16. 1-Planar Graphs at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Graph G

  17. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Graph G

  18. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G

  19. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G

  20. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G

  21. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G

  22. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G

  23. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G Fixing edges

  24. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G Fixing edges

  25. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G Fixing edges

  26. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G Fixing edges Special edge

  27. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G Fixing edges Special edge

  28. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G Fixing edges Special edge not 1-planar, 2 crossings

  29. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G Fixing edges Special edge 1-planar, n − 2 crossings not 1-planar, 2 crossings

  30. [Korzhik & Mohar ’13] 1-Planar Graphs This is the only 1-planar embedding of G at most 4 n − 8 edges, n − 2 crossings ⇒ ̺ 1-pl ≤ n /2 − 1 Dual G ∗ Graph G Fixing edges Special edge ̺ 1-pl = n /2 − 1 1-planar, n − 2 crossings not 1-planar, 2 crossings

  31. Fan-Planar Graphs at most 5 n − 10 edges

  32. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings

  33. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 )

  34. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) K 3,3

  35. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) K 3,3

  36. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) ℓ

  37. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) ℓ

  38. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) ℓ

  39. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) ℓ

  40. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) ℓ

  41. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) ℓ

  42. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) ℓ

  43. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) ℓ

  44. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) not fan-planar, 2 crossings ℓ

  45. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) not fan-planar, 2 crossings ℓ

  46. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) not fan-planar, 2 crossings ℓ

  47. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) not fan-planar, 2 crossings ℓ

  48. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) not fan-planar, 2 crossings ℓ

  49. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) not fan-planar, 2 crossings fan-planar, ℓ + 1 ≈ n /12 crossings ℓ

  50. Fan-Planar Graphs at most 5 n − 10 edges ⇒ O ( n 2 ) crossings ⇒ ̺ fan ∈ O ( n 2 ) not fan-planar, 2 crossings fan-planar, ℓ + 1 ≈ n /12 crossings ℓ

Recommend

The Gap between Crossing Numbers and Outerplanar Crossing Numbers EPSRC GR/R37395/01:

The Gap between Crossing Numbers and Outerplanar Crossing Numbers EPSRC GR/R37395/01:

The Gap between Crossing Numbers and Outerplanar Crossing Numbers EPSRC GR/R37395/01: Parallel and Sequential Algorithms for Low Crossing Graph Drawing (2001-2004) EPSRC - GR/S76694/01: Outerplanar Crossing Numbers (2003-2006) Farhad

238 views • 19 slides
Q Is 1 Planar Graphs IDefI A graph is called plane if it can be drawn in the plane without any

Q Is 1 Planar Graphs IDefI A graph is called plane if it can be drawn in the plane without any

Khalil's Yining's Amin's Soda Hall Mo ffi tt Library VLSB it possible to design the streets without crossing Q Is 1 Planar Graphs IDefI A graph is called plane if it can be drawn in the plane without any edges crossing Such a drawing is called

526 views • 8 slides
Improved bounds on crossing numbers of graphs via semidefinite programming Etienne de Klerk

Improved bounds on crossing numbers of graphs via semidefinite programming Etienne de Klerk

Improved bounds on crossing numbers of graphs via semidefinite programming Etienne de Klerk and Dima Pasechnik Tilburg University, The Netherlands Francqui chair awarded to Yurii Nesterov, Liege, February 17th, 2012 Etienne de Klerk

255 views • 21 slides
Binary trees, super-Catalan numbers and 3-connected Planar Graphs Gilles Schaeffer LIX, CNRS/

Binary trees, super-Catalan numbers and 3-connected Planar Graphs Gilles Schaeffer LIX, CNRS/

Binary trees, super-Catalan numbers and 3-connected Planar Graphs Gilles Schaeffer LIX, CNRS/ Ecole Polytechnique Based in part on a joint work with E. Fusy and D. Poulalhon Mon premier souvenir dun cours de combinatoire... Mots de Dyck

803 views • 67 slides
1.5 The Crossing-Lemma Averaging Technique Given a graph G = ( V, E ), let cr ( G ) denote the

1.5 The Crossing-Lemma Averaging Technique Given a graph G = ( V, E ), let cr ( G ) denote the

1.5 The Crossing-Lemma Averaging Technique Given a graph G = ( V, E ), let cr ( G ) denote the crossing number The Crossing Lemma. of G , which is the minimum of the number of crossings of any embedding of G in R 2 . By definition, planar graphs

339 views • 4 slides
8.7 PLANAR GRAPHS def: A graph is planar if it can be drawn with- out edge-crossings in the

8.7 PLANAR GRAPHS def: A graph is planar if it can be drawn with- out edge-crossings in the

8.7.1 Section 8.7 Planar Graphs 8.7 PLANAR GRAPHS def: A graph is planar if it can be drawn with- out edge-crossings in the plane. Given a graph G and a Imbedding Problem: surface S , is it possible to draw G on S without any

372 views • 18 slides
LAGOS 2017 Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs Isidoro

LAGOS 2017 Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs Isidoro

Almost-planar graphs Deltawye reduction of almost-planar graph Almost-planar graphs on the projective plane Deltawye reduction with terminals of almost-planar graphs Future Research LAGOS 2017 Delta-Wye Transformations and the Efficient

1.3k views • 45 slides
Vertex-Minimal ertex-Minimal Planar Planar Graphs Graphs with with a Prescrib Prescribed ed

Vertex-Minimal ertex-Minimal Planar Planar Graphs Graphs with with a Prescrib Prescribed ed

Vertex-Minimal ertex-Minimal Planar Planar Graphs Graphs with with a Prescrib Prescribed ed Automorphism utomorphism Group Group C.J. Jones, Sarah E. Lubow, and Carlie J. Triplitt University of Texas at Tyler Automorphism Group of a

435 views • 27 slides
1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area Steven Chaplick, Fabian Lipp,

1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area Steven Chaplick, Fabian Lipp,

1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area Steven Chaplick, Fabian Lipp, Alexander Wolff, and Johannes Zink Beyond-Planar Graphs 2 Types of Drawings: Planar: No crossings Beyond-Planar Graphs 2 Types of Drawings:

1.12k views • 107 slides
10 Steps to Counting Unlabeled Planar Graphs: 20 Years Later Manuel Bodirsky October 2007

10 Steps to Counting Unlabeled Planar Graphs: 20 Years Later Manuel Bodirsky October 2007

10 Steps to Counting Unlabeled Planar Graphs: 20 Years Later Manuel Bodirsky October 2007 Counting Unlabeled Planar Graphs A005470 Sloane Sequence A005470 (core, nice, hard): Number p ( n ) of unlabeled planar simple graphs with n nodes.

814 views • 70 slides
Geometric representations of planar graphs and maps Eric Fusy (CNRS/LIX) Summer school on

Geometric representations of planar graphs and maps Eric Fusy (CNRS/LIX) Summer school on

Geometric representations of planar graphs and maps Eric Fusy (CNRS/LIX) Summer school on random geometry, Bogota, may 2016 Overview of the course Planar graphs and planar maps - structural aspects 1 1 2 2 2 2 3 3 -

1.74k views • 160 slides
Chapter 7 Planar graphs In full: 7.17.3 Parts of: 7.4, 7.67.8 Skip: 7.5 Prof. Tesler

Chapter 7 Planar graphs In full: 7.17.3 Parts of: 7.4, 7.67.8 Skip: 7.5 Prof. Tesler

Chapter 7 Planar graphs In full: 7.17.3 Parts of: 7.4, 7.67.8 Skip: 7.5 Prof. Tesler Math 154 Winter 2020 Prof. Tesler Ch. 7: Planar Graphs Math 154 / Winter 2020 1 / 52 Planar graphs Definition A planar embedding of a graph is a

1.02k views • 52 slides
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends Steven Chaplick,

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends Steven Chaplick,

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends Steven Chaplick, Fabian Lipp, Alexander Wolff, and Johannes Zink Introduction: Beyond-Planar Graphs 2 Types of drawings: Planar: No crossings Introduction:

1.55k views • 139 slides
Cubic Planar Graphs That Cannot Be Drawn On Few Lines David Eppstein University of California,

Cubic Planar Graphs That Cannot Be Drawn On Few Lines David Eppstein University of California,

Cubic Planar Graphs That Cannot Be Drawn On Few Lines David Eppstein University of California, Irvine Symposium on Computational Geometry, June 2019 Planar graph drawing on one line Always possible using 2 semicircles per edge Planar graph

432 views • 16 slides
Densest/Heaviest k -subgraph on Interval Graphs, Chordal Graphs and Planar Graphs Presented by

Densest/Heaviest k -subgraph on Interval Graphs, Chordal Graphs and Planar Graphs Presented by

Densest/Heaviest k -subgraph on Interval Graphs, Chordal Graphs and Planar Graphs Presented by Jian Li, Fudan University Mar 2007, HKUST May 8, 2006 1 / 25 Problem Definition: Densest k -Subgraph Problem(DS- k ): Input: G ( V, E ) , k > 0 .

398 views • 25 slides
On the diameter of random planar graphs Guillaume Chapuy, CNRS & LIAFA, Paris joint work

On the diameter of random planar graphs Guillaume Chapuy, CNRS & LIAFA, Paris joint work

On the diameter of random planar graphs Guillaume Chapuy, CNRS & LIAFA, Paris joint work with Eric Fusy, Paris, Omer Gim enez, ex-Barcelona, Marc Noy, Barcelona. Probability and Graphs, Eurandom, Eindhoven, 2014. Planar graphs and

806 views • 51 slides
Combinatorics, Logic and Probability Logical limit laws for planar graphs and graphs on surfaces

Combinatorics, Logic and Probability Logical limit laws for planar graphs and graphs on surfaces

Combinatorics, Logic and Probability Logical limit laws for planar graphs and graphs on surfaces Marc Noy Universitat Polit` ecnica de Catalunya, Barcelona Barcelona Graduate School of Mathematics A zero-one law G class of labelled graphs G n

499 views • 30 slides
Coding, counting, and sampling triangulations and other planar graphs Gilles S CHAEFFER CNRS,

Coding, counting, and sampling triangulations and other planar graphs Gilles S CHAEFFER CNRS,

. Coding, counting, and sampling triangulations and other planar graphs Gilles S CHAEFFER CNRS, cole Polytechnique A N OVERVIEW OF THE TALK I. 3-c planar graphs II. Binary trees and a combinatorial approach III. From trees to dissections,

1.65k views • 138 slides
CS70 - Lecture 6 Graphs: Coloring; Special Graphs 1. Review of L5 2. Planar Five Color Theorem

CS70 - Lecture 6 Graphs: Coloring; Special Graphs 1. Review of L5 2. Planar Five Color Theorem

CS70 - Lecture 6 Graphs: Coloring; Special Graphs 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs: Trees: Three characterizations Hypercubes: Strongly connected! Administration You need to submit you grading option

514 views • 29 slides
Planar Induced Subgraphs of Sparse Graphs Glencora Borradaile, David Eppstein , and Pingan Zhu

Planar Induced Subgraphs of Sparse Graphs Glencora Borradaile, David Eppstein , and Pingan Zhu

Planar Induced Subgraphs of Sparse Graphs Glencora Borradaile, David Eppstein , and Pingan Zhu Graph Drawing 2014 The planarization problem Goal: find big planar subgraphs in nonplanar graphs Equivalently: delete as little as possible so the

397 views • 17 slides
Triangles and 3-coloring of planar graphs Bernard Lidick Iowa State University February 4,

Triangles and 3-coloring of planar graphs Bernard Lidick Iowa State University February 4,

Triangles and 3-coloring of planar graphs Bernard Lidick Iowa State University February 4, 2015 Outline what is graph coloring? Grtzschs theorem: triangle-free planar graphs are 3-colorable extensions of GT preserving

2.15k views • 106 slides
Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Winter 2019 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Winter 2019 1 / 46 12.112.2. Planar graphs Definition A planar embedding of a

627 views • 46 slides
1-Fan-Bundle-Planar Drawings of Graphs Patrizio Angelini Michael A. Bekos Michael Kaufmann

1-Fan-Bundle-Planar Drawings of Graphs Patrizio Angelini Michael A. Bekos Michael Kaufmann

1-Fan-Bundle-Planar Drawings of Graphs Patrizio Angelini Michael A. Bekos Michael Kaufmann Philipp Kindermann Thomas Schneck Beyond Planarity Planar Beyond Planarity 1-planar Beyond Planarity 2-planar Beyond Planarity k -planar Beyond

2.19k views • 162 slides
2020/1 I 24 knot Friday Seminar Theory on Folklore ) Ic ( CL ) UCL L ) link E i

2020/1 I 24 knot Friday Seminar Theory on Folklore ) Ic ( CL ) UCL L ) link E i

Unknotting and numbers of spatial embeddings numbers Crossing planar of graph a Akimoto joint Yuta with work University ) Waseda ( Ta ( Waseda University ) Kou ki hiyama 2020/1 I 24 knot Friday Seminar Theory on

504 views • 27 slides

More recommend