A Survey on the 3-Decomposition Conjecture Arthur Hoffmann-Ostenhof, Technical University of Vienna Pilsen, 2015.

Slides:

Advertisements

Similar presentations

Chapter 8 Topics in Graph Theory

Advertisements

Chapter 9 Graphs.

1 NP-completeness Lecture 2: Jan P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.

Chapter 9 Connectivity 连通度. 9.1 Connectivity Consider the following graphs:  G 1 : Deleting any edge makes it disconnected.  G 2 : Cannot be disconnected.

Cubic Subgraphs Why? Why not?. 5 vertices, 8 edges, claw-free, no cubic subgraph.

1 Construction of Hamiltonian Cycles in Layered Cubic Planar Graphs Graphs and Combinatorics 2002 D.S. Franzblau Department of Mathematics, CUNY/College.

Small cycle cover of 3-connected cubic graphs Fan Yang ( 杨帆 ) and Xiangwen Li ( 李相文 ) Dep. of Mathematics Huazhong Normal University, Wuhan, China

Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.

1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.

PLANAR SHORTEST PATH & R-DIVISIONS Dwyane George March 10, 2015.

1 A survey of ascending subgraph decomposition 胡維新.

2k-Cycle Free Bipartite Graph Steven Wu. What is a bipartite graph?

What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.

What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.

Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.

CTIS 154 Discrete Mathematics II1 8.2 Paths and Cycles Kadir A. Peker.

W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Graph theory and routing (initial background) E E Lecture 4.

Drawing of G. Planar Embedding of G Proposition Proof. 1. Consider a drawing of K 5 or K 3,3 in the plane. Let C be a spanning cycle. 2. If the.

Rectangular Drawing Imo Lieberwerth. Content Introduction Rectangular Drawing and Matching Thomassen’s Theorem Rectangular drawing algorithm Advanced.

What is the next line of the proof? a). Assume the theorem holds for all graphs with k edges. b). Let G be a graph with k edges. c). Assume the theorem.

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.

Graph Theory Ch6 Planar Graphs. Basic Definitions  curve, polygon curve, drawing  crossing, planar, planar embedding, and plane graph  open set  region,

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.

5.2 Trees  A tree is a connected graph without any cycles.

V Spanning Trees Spanning Trees v Minimum Spanning Trees Minimum Spanning Trees v Kruskal’s Algorithm v Example Example v Planar Graphs Planar Graphs v.

The countable character of uncountable graphs François Laviolette Barbados 2003.

MAT 2720 Discrete Mathematics Section 8.7 Planar Graphs

Agenda Review: –Planar Graphs Lecture Content:  Concepts of Trees  Spanning Trees  Binary Trees Exercise.

Planar graphs with no 5- cycles, 6-cycles or intersecting triangles are 3-colorable Carl Yerger, Davidson College Clemson Mini-Conference 2012.

5.8 Graph Matching  Example: Set of worker assign to a set of task  Four tasks are to be assigned to four workers.  – Worker 1 is qualified to do tasks.

An Introduction to Graph Theory

Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.

Homework #5 Due: October 31, 2000 Christine Kang Graph Concepts and Algorithms.

MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles

 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.

Xuding Zhu Zhejiang Normal University Budapest Circular flow of signed graphs.

Graph Concepts and Algorithms Using LEDA By Caroline Moore and Carmen Frerichs (252a-at and 252a-ao) each graph in the presentation was created using gw_basic_graph_algorithms.

5-color theorem 林典濤 : PPT, Lecture note 陳咨翰 : Presentation.

1) Find and label the degree of each vertex in the graph.

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Chapter 7 Planar Graphs 大葉大學資訊工程系黃鈴玲  7.2 Planar Embeddings  7.3 Euler’s Formula and Consequences  7.4 Characterization of Planar Graphs.

1 Variations of the maximum leaf spanning tree problem for bipartite graphs P.C. Li and M. Toulouse Information Processing Letters 97 (2006) /03/14.

Amazons Puzzles are NP- Complete. G∞ is the infinite grid. Cubic Subgrid Graphs are subgraphs of G∞ where nodes have degree at most three. HC3G = {G |

Spanning Trees Alyce Brady CS 510: Computer Algorithms.

Outline 1 Properties of Planar Graphs 5/4/2018.

Discrete Mathematics Graph: Planar Graph Yuan Luo

Proof technique (pigeonhole principle)

The countable character of uncountable graphs François Laviolette Barbados 2003.

Graph theory Definitions Trees, cycles, directed graphs.

What is the next line of the proof?

Spanning Trees Discrete Mathematics.

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Acyclic List Edge Coloring of Graphs

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Theorem 5.13: For vT‘, l’(v)= min{l(v), l(vk)+w(vk, v)}

Student：連敏筠 Advisor：傅恆霖

MAT 2720 Discrete Mathematics

Miniconference on the Mathematics of Computation

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 8th ed., by Kenneth H.

N(S) ={vV|uS,{u,v}E(G)}

GRAPH THEORY Properties of Planar Graphs Ch9-1.

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Concepts of Computation

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

GRAPH THEORY Properties of Planar Graphs Ch9-1.

Lecture 24 Vertex Cover and Hamiltonian Cycle

Presentation transcript:

A Survey on the 3-Decomposition Conjecture Arthur Hoffmann-Ostenhof, Technical University of Vienna Pilsen, 2015

3-Decomposition Conjecture (3DC), AHO, 2009 Every connected cubic graph has a decompositon into a spanning tree, a set of cycles and a matching. Theorem (C.Thomassen, B.Toft, 1979) Every connected cubic graph G has a cycle C such that G-EC is connected.

Question (Malkevitch, 1979) Which cubic graphs have a decompositon into a spanning tree, and a set of cycles? Open Problem (Albertson, Berman, Hutchingson, Thomassen, 1990) Is there for each k > 1 a cyclically k-edge connected cubic graph without such a decomposition? History

Special Cases Theorem 1 (AHO) Every hamiltonian cubic graph has a 3D. Definition 1 A 3-decomposition (3D) of a cubic graph G is a decompositon of G into a spanning tree, a family of cycles and a matching. Proof:

Theorem 2 (K.Ozeki, D.Ye, 2014) Every 3-connected cubic plane graph has a 3D. Every 3-connected cubic graph embedded on the projective plane has a 3D. Theorem 3 (A. Bachstein, D. Ye, 2015) Every 3-connected cubic graph embedded on the torus has a 3D. Every 3-connected cubic graph embedded on the Klein bottle has a 3D. Best Results

Theorem 4 (AHO) The Strong-3DC and the 3DC are equivalent. Variations of the 3DC Strong-3DC Let G be a connected cubic graph and C be a 2-regular subgraph of G such that G-EC is connected. Then there is a 3D of G such that the set of cycles of the 3D contains every cycle of C. 3-Decomposition Conjecture (3DC) Every connected cubic graph has a 3D, i.e. a decompositon into a spanning tree, a set of cycles and a matching.

Variations of the 3DC 2-Decomposition Conjecture (2DC) Let G be a connected graph with vertices only of degree 2 and 3 such that for every cycle C of G, G-EC is not connected. Then there is a decomposition of G into a spanning tree and a matching. Theorem 5 (AHO) The 3DC, the and the 2DC are equivalent. Theorem (Y.Wang and Q. Zhang,) (nur mündlich?) Every planar graph with girth at least 8 has a 2D. Proof:

Related Results (2DC) 2-Decomposition Conjecture (2DC) Let G be a connected graph with vertices only of degree 2 and 3 such that for every cycle C of G, G-EC is not connected. Then there is a decomposition of G into a spanning tree and a matching. Theorem 6 (Y.Wang and Q. Zhang, 2011) Every planar graph with girth at least 8 has a 2D.

Definiton 2 A tree T of a plane graph G is called free, if for every vertex v of G, the edges of T incident with v are not in the same facial cycle of G. Free-Tree Conjecture (AHO) Let G be a connected plane graph where every facial cycle has length 2 or 3 and where every vertex of G is contained in a cycle of length 2. Then G has a spanning free tree. 3DC - Planar Variations Theorem 8 (AHO) The Free-Tree Conjecture, the planar-3DC and the planer-2DC are equivalent.

THANKS FOR YOUR ATTENTION

Theorem (Albertson, Berman,Hutchingson, Thomassen; 1990) Every connected graph G with n vertices has a HIST if δ(G) is at least 4(2n)^1/2. Generalized Question for graphs with higher vertex degree Which graphs have a HIST? (Homeomorphically Irreducible Spanning Tree) Theorem (Lemke, 1988) It is NP-complete to determine whether a given cubic graph has a decomposition into a spanning tree and cycles..