graphs with no short cycle covers
play

Graphs with no short cycle covers Edita M a cajov a Comenius - PowerPoint PPT Presentation

Jan 13, 2023 •300 likes •1.06k views

Graphs with no short cycle covers Edita M a cajov a Comenius University, Bratislava Ghent, August 2019 joint work with Martin Skoviera Edita M a cajov a (Bratislava) Lower bound od SCC August 2019 1 / 23 Cycle cover

  1. Graphs with no short cycle covers Edita M´ aˇ cajov´ a Comenius University, Bratislava Ghent, August 2019 joint work with Martin ˇ Skoviera Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 1 / 23

  2. Cycle cover cycle – a graph with every vertex of even degree Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 2 / 23

  3. Cycle cover cycle – a graph with every vertex of even degree cycle cover of a bridgeless graph G – a collection of cycles that cover every edge of G Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 2 / 23

  4. Cycle cover cycle – a graph with every vertex of even degree cycle cover of a bridgeless graph G – a collection of cycles that cover every edge of G length of a cycle cover C – the sum of lengths of all the cycles in C Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 2 / 23

  5. Cycle cover cycle – a graph with every vertex of even degree cycle cover of a bridgeless graph G – a collection of cycles that cover every edge of G length of a cycle cover C – the sum of lengths of all the cycles in C scc ( G ) ... the length of a shortest cycle cover Short cycle cover problem (Itai, Rodeh, 1978) Given a bridgeless graph, what is the length of its shortest cycle cover? quickly gained great prominence Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 2 / 23

  6. Cycle cover cycle – a graph with every vertex of even degree cycle cover of a bridgeless graph G – a collection of cycles that cover every edge of G length of a cycle cover C – the sum of lengths of all the cycles in C scc ( G ) ... the length of a shortest cycle cover Short cycle cover problem (Itai, Rodeh, 1978) Given a bridgeless graph, what is the length of its shortest cycle cover? quickly gained great prominence Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 2 / 23

  7. Short cycle cover conjecture Short cycle cover conjecture (Alon, Tarsi; Jaeger; 1985) Every bridgeless graph G has a cycle cover of length at most 7 5 · | E ( G ) | . Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 3 / 23

  8. Short cycle cover conjecture Short cycle cover conjecture (Alon, Tarsi; Jaeger; 1985) Every bridgeless graph G has a cycle cover of length at most 7 5 · | E ( G ) | . scc ( Pg ) = 7 5 · | E ( Pg ) | Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 3 / 23

  9. Short cycle cover conjecture Short cycle cover conjecture (Alon, Tarsi; Jaeger; 1985) Every bridgeless graph G has a cycle cover of length at most 7 5 · | E ( G ) | . scc ( Pg ) = 7 5 · | E ( Pg ) | Theorem (Bermond,Jackson,Jaeger 1983; Alon, Tarsi, 1985) Every bridgeless graph G has a cycle cover of length at most 5 3 · | E ( G ) | . Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 3 / 23

  10. Related problems Conjecture is optimization in nature, however it implies Cycle double cover conjecture (Jamshy, Tarsy, 1992) Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 4 / 23

  11. Related problems Conjecture is optimization in nature, however it implies Cycle double cover conjecture (Jamshy, Tarsy, 1992) SCCC is implied by the Petersen colouring conjecture Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 4 / 23

  12. Related problems Conjecture is optimization in nature, however it implies Cycle double cover conjecture (Jamshy, Tarsy, 1992) SCCC is implied by the Petersen colouring conjecture Chinese postman problem scc ( G ) ≥ cp ( G ) Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 4 / 23

  13. SCCC and cubic graphs crucial are cubic graphs because the largest values of the covering ratio between scc ( G ) and | E ( G ) | are known for cubic graphs Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 5 / 23

  14. SCCC and cubic graphs crucial are cubic graphs because the largest values of the covering ratio between scc ( G ) and | E ( G ) | are known for cubic graphs the covering ratio 7 5 is reached for infinitely many cubic graphs with cyclic connectivity 2 and 3 Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 5 / 23

  15. SCCC and cubic graphs crucial are cubic graphs because the largest values of the covering ratio between scc ( G ) and | E ( G ) | are known for cubic graphs the covering ratio 7 5 is reached for infinitely many cubic graphs with cyclic connectivity 2 and 3 [Fan 2017] the covering ratio for bridgeless cubic graphs is at most 218/135 ( ≈ 1 . 6148) Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 5 / 23

  16. SCCC and cubic graphs crucial are cubic graphs because the largest values of the covering ratio between scc ( G ) and | E ( G ) | are known for cubic graphs the covering ratio 7 5 is reached for infinitely many cubic graphs with cyclic connectivity 2 and 3 [Fan 2017] the covering ratio for bridgeless cubic graphs is at most 218/135 ( ≈ 1 . 6148) [Lukot ’ka 2017] the covering ratio for bridgeless cubic graphs is at most 212/135 ( ≈ 1 . 5703) Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 5 / 23

  17. SCCC and cubic graphs a natural lower bound for the covering ratio of cubic graphs is 4 3 Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 6 / 23

  18. SCCC and cubic graphs a natural lower bound for the covering ratio of cubic graphs is 4 3 3-edge-colourable cubic graphs have the covering ratio 4 3 Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 6 / 23

  19. SCCC and cubic graphs a natural lower bound for the covering ratio of cubic graphs is 4 3 3-edge-colourable cubic graphs have the covering ratio 4 3 all cyclically 4-edge-connected cubic graphs where the covering ratio is known have the value close to 4 3 [Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013] Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 6 / 23

  20. SCCC and cubic graphs a natural lower bound for the covering ratio of cubic graphs is 4 3 3-edge-colourable cubic graphs have the covering ratio 4 3 all cyclically 4-edge-connected cubic graphs where the covering ratio is known have the value close to 4 3 [Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013] [Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013] up to 36 vertices there are two non-trivial cubic graphs that have the covering ratio greater than 4 3 (the Petersen graph and G 34 discovered by H¨ agglund in 2016) Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 6 / 23

  21. SCCC and cubic graphs a natural lower bound for the covering ratio of cubic graphs is 4 3 3-edge-colourable cubic graphs have the covering ratio 4 3 all cyclically 4-edge-connected cubic graphs where the covering ratio is known have the value close to 4 3 [Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013] [Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013] up to 36 vertices there are two non-trivial cubic graphs that have the covering ratio greater than 4 3 (the Petersen graph and G 34 discovered by H¨ agglund in 2016) both these graphs have scc ( G ) = 4 3 · | E ( G ) | + 1 Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 6 / 23

  22. SCCC and cubic graphs a natural lower bound for the covering ratio of cubic graphs is 4 3 3-edge-colourable cubic graphs have the covering ratio 4 3 all cyclically 4-edge-connected cubic graphs where the covering ratio is known have the value close to 4 3 [Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013] [Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013] up to 36 vertices there are two non-trivial cubic graphs that have the covering ratio greater than 4 3 (the Petersen graph and G 34 discovered by H¨ agglund in 2016) both these graphs have scc ( G ) = 4 3 · | E ( G ) | + 1 [Esperet, Mazzuoccolo, 2014] infinite family with scc ( G ) > 4 3 · | E ( G ) | [Esperet, Mazzuoccolo, 2014] there exists G with scc ( G ) ≥ 4 3 · | E ( G ) | + 2 Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 6 / 23

  23. SCCC and cubic graphs Conjecture (Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013) For every cyclically 4-edge-connected cubic graph G with m edges scc ( G ) ≤ 4 3 · m + o ( m ) . Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 7 / 23

  24. SCCC and cubic graphs Conjecture (Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013) For every cyclically 4-edge-connected cubic graph G with m edges scc ( G ) ≤ 4 3 · m + o ( m ) . evidence for this conjecture: [H¨ agglund, Markstr¨ om, 2013], [Steffen, 2015] Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 7 / 23

  25. SCCC and cubic graphs Conjecture (Brinkmann, Goedgebeur, H¨ agglund, Markstr¨ om, 2013) For every cyclically 4-edge-connected cubic graph G with m edges scc ( G ) ≤ 4 3 · m + o ( m ) . evidence for this conjecture: [H¨ agglund, Markstr¨ om, 2013], [Steffen, 2015] we disprove the conjecture: Theorem (EM,ˇ Skoviera) There exists a family of cyclically 4-edge-connected cubic graphs G n , n ≥ 1 such that scc ( G n ) ≥ (4 3 + 1 69) | E ( G n ) | . Edita M´ aˇ cajov´ a (Bratislava) Lower bound od SCC August 2019 7 / 23

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Short cycle covers of graphs with minimum degree three Tom Kaiser, Daniel Krl, Bernard

Short cycle covers of graphs with minimum degree three Tom Kaiser, Daniel Krl, Bernard

Short cycle covers of graphs with minimum degree three Tom Kaiser, Daniel Krl, Bernard Lidick and Pavel Nejedl Department of Applied Math Charles University Cycles and Colourings 2008 - Tatransk trba Short cycle covers of

645 views • 32 slides
Matchings, star par..ons, and clique covers in interval graphs: Graph

Matchings, star par..ons, and clique covers in interval graphs: Graph

Matchings, star par..ons, and clique covers in interval graphs: Graph theore.cal tools in transporta.on science. Irith Ben-Arroyo Hartman University of Haifa and NYU-

794 views • 66 slides
FPT algorithms for path-transversals and cycle-transversals problems in graphs S. Guillemot

FPT algorithms for path-transversals and cycle-transversals problems in graphs S. Guillemot

FPT algorithms for path-transversals and cycle-transversals problems in graphs S. Guillemot INRIA, France 20 February 2008 S. Guillemot (INRIA, France) FPT algorithms ... 20 February 2008 1 / 10 Introduction In short: We consider graph

446 views • 23 slides
Stable Sets in Graphs with Bounded Odd Cycle Packing Number Tony Huynh (Monash) joint with

Stable Sets in Graphs with Bounded Odd Cycle Packing Number Tony Huynh (Monash) joint with

Stable Sets in Graphs with Bounded Odd Cycle Packing Number Tony Huynh (Monash) joint with Michele Conforti, Samuel Fiorini, Gwena el Joret, and Stefan Weltge Maximum Weight Stable Set Tony Huynh Stable Sets in Graphs with Bounded Odd Cycle

794 views • 77 slides
Overview 1. Our students 2. Structure of the Junior Cycle 3. Subjects, Short Courses, Wellbeing,

Overview 1. Our students 2. Structure of the Junior Cycle 3. Subjects, Short Courses, Wellbeing,

Overview 1. Our students 2. Structure of the Junior Cycle 3. Subjects, Short Courses, Wellbeing, and Other Areas of Learning 4. Assessment and Reporting 5. Junior Cycle Profile of Achievement (JCPA) What is the purpose of education in

585 views • 35 slides
3-coloring triangle-free planar graphs with a precolored 9-cycle ILKYOO CHOI 1 , Jan Ekstein 2 ,

3-coloring triangle-free planar graphs with a precolored 9-cycle ILKYOO CHOI 1 , Jan Ekstein 2 ,

3-coloring triangle-free planar graphs with a precolored 9-cycle 3-coloring triangle-free planar graphs with a precolored 9-cycle ILKYOO CHOI 1 , Jan Ekstein 2 , P remysl Holub 2 , Bernard Lidick y 1 University of Illinois at

1.75k views • 99 slides
Stabilizing Weighted Graphs Zhuan Khye Koh Laura Sanit` a Combinatorics and Optimization

Stabilizing Weighted Graphs Zhuan Khye Koh Laura Sanit` a Combinatorics and Optimization

Stabilizing Weighted Graphs Zhuan Khye Koh Laura Sanit` a Combinatorics and Optimization University of Waterloo, Canada July 3, 2018 Matchings and w -vertex covers Matchings and w -vertex covers Let G = ( V , E ) be a graph with

1.58k views • 142 slides
On s -fully cycle extendable line graphs Yehong Shao Ohio University Southern, Ironton, OH 45638

On s -fully cycle extendable line graphs Yehong Shao Ohio University Southern, Ironton, OH 45638

On s -fully cycle extendable line graphs Yehong Shao Ohio University Southern, Ironton, OH 45638 p. 1/15 Definitions p. 2/15 fully cycle extendable A graph G is said to be fully cycle extendable if every vertex of G lies on a

697 views • 41 slides
Permutation Covers Charles J. Colbourn School of Computing, Informatics, and Decision Systems

Permutation Covers Charles J. Colbourn School of Computing, Informatics, and Decision Systems

Permutation Covers Charles J. Colbourn Permutation Covers Charles J. Colbourn School of Computing, Informatics, and Decision Systems Engineering Arizona State University Workshop on Graphs and Algorithms, Fields Institute, May 2014

411 views • 15 slides
Local Properties of Graphs and the Hamilton Cycle Problem Johan de Wet 1 , 2 and Marietjie Frick 1

Local Properties of Graphs and the Hamilton Cycle Problem Johan de Wet 1 , 2 and Marietjie Frick 1

Local Properties of Graphs and the Hamilton Cycle Problem Johan de Wet 1 , 2 and Marietjie Frick 1 1 University of Pretoria 2 DST-NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS) Bucharest 2018 Johan de Wet et al. (UP,

1.26k views • 113 slides
PRE-KICK OFF LOCAL MEETING Inter erdisciplinar disciplinary short t cycle programs ms in

PRE-KICK OFF LOCAL MEETING Inter erdisciplinar disciplinary short t cycle programs ms in

PRE-KICK OFF LOCAL MEETING Inter erdisciplinar disciplinary short t cycle programs ms in public ic policy cy makin ing and analysi ysis s (PPMA) A) Project ct Reference rence 598596-EPP PP-1-20 2018 18-1-RS RS-EPP PPKA2

266 views • 8 slides
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation 1 Marcin

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation 1 Marcin

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation 1 Marcin Pilipczuk, Micha l Ziobro March 12, 2019 1 Supported by the Recent trends in kernelization: theory and experimental evaluation project, carried

708 views • 41 slides
SLIM: Short Cycle Time and Low Inventory in Manufacturing at Samsung Electronics Corp., (SEC)

SLIM: Short Cycle Time and Low Inventory in Manufacturing at Samsung Electronics Corp., (SEC)

SLIM: Short Cycle Time and Low Inventory in Manufacturing at Samsung Electronics Corp., (SEC) 8/10/2020 SLIM Presentation 1 Introductions Prof. Rob Leachman, UCB IEOR Dept., technical author and SLIM project manager Dr. Jeenyoung Kang,

872 views • 53 slides
Voronoi Games on Cycle Graphs Marios Mavronicolas Burkhard Monien Vicky G. Papadopoulou Florian

Voronoi Games on Cycle Graphs Marios Mavronicolas Burkhard Monien Vicky G. Papadopoulou Florian

Introduction The Model Characterization of NE Quality of NE Conclusion Voronoi Games on Cycle Graphs Marios Mavronicolas Burkhard Monien Vicky G. Papadopoulou Florian Schoppmann Department of Computer Science International Graduate School

658 views • 45 slides
Graphs () Graphs () Graphs Graphs Graphs are collections of nodes

Graphs () Graphs () Graphs Graphs Graphs are collections of nodes

Graphs () Graphs () Graphs Graphs Graphs are collections of nodes in which various pairs are connected by K08 line segments. The

627 views • 17 slides
Junior Cycle Click Title Information for Parents Overview 1. Our students 2. Structure of the

Junior Cycle Click Title Information for Parents Overview 1. Our students 2. Structure of the

Junior Cycle Click Title Information for Parents Overview 1. Our students 2. Structure of the Junior Cycle 3. Subjects, Short Courses, Wellbeing and Other Areas of Learning 4. Assessment and Reporting 5. Junior Cycle Profile of Achievement

381 views • 36 slides
Short covering codes in Hamming spaces Anderson N. Martinh ao Centro de Ci encias Exatas

Short covering codes in Hamming spaces Anderson N. Martinh ao Centro de Ci encias Exatas

Short covering codes in Hamming spaces Anderson N. Martinh ao Centro de Ci encias Exatas Universidade Estadual de Maring a Programa de P os-Graduac ao em Matem atica Joint work with Dr. Emerson L. Monte Carmelo January

194 views • 6 slides
Efficient Receipt-Free Ballot Casting Resistant to Covert Channels Ben Adida C. Andrew Neff

Efficient Receipt-Free Ballot Casting Resistant to Covert Channels Ben Adida C. Andrew Neff

Efficient Receipt-Free Ballot Casting Resistant to Covert Channels Ben Adida C. Andrew Neff EVT / WOTE August 11th, 2009 Montreal, Canada Andy uses a voting machine to prepare a ballot. Andy wants to verify that the machine properly

637 views • 32 slides
The Social Responsibility of Firms: The Case of Effective Altruism Andrs Mikls Simon Business

The Social Responsibility of Firms: The Case of Effective Altruism Andrs Mikls Simon Business

The Social Responsibility of Firms: The Case of Effective Altruism Andrs Mikls Simon Business School University of Rochester Sustainability in business A mix of political, social, environmental, and economic goals How should these be

423 views • 11 slides
Once for All: Train One Network and Specialize it for Efficient Deployment Han Cai, Chuang Gan,

Once for All: Train One Network and Specialize it for Efficient Deployment Han Cai, Chuang Gan,

Once for All: Train One Network and Specialize it for Efficient Deployment Han Cai, Chuang Gan, Tianzhe Wang, Zhekai Zhang, Song Han Massachusetts Institute of Technology Once-for-All, ICLR20 Challenge: Efficient Inference on Diverse

266 views • 26 slides
Decidable Problems for Counter Systems Day 3 Vector Addition Systems St ephane Demri

Decidable Problems for Counter Systems Day 3 Vector Addition Systems St ephane Demri

Decidable Problems for Counter Systems Day 3 Vector Addition Systems St ephane Demri demri@lsv.ens-cachan.fr LSV, ENS Cachan, CNRS, INRIA ESSLLI 2010, Copenhagen, August 2010 Plan of the talk Previous lectures: Classes of counter

1.09k views • 63 slides
Construction of covering arrays from Outline m-sequences Covering arrays Definition Research

Construction of covering arrays from Outline m-sequences Covering arrays Definition Research

Construction of covering arrays from m-sequences Georgios Tzanakis Construction of covering arrays from Outline m-sequences Covering arrays Definition Research on CAs Motivation Sequences Georgios Tzanakis 1 Definition m-sequences Our

664 views • 64 slides
Requirements Engineering Software Engineering Software Engineering Andreas Zeller Saarland

Requirements Engineering Software Engineering Software Engineering Andreas Zeller Saarland

Based on the Book by Pressman: Software Engineering a Practitioners Approach, as well as Wikipedia Requirements Engineering Software Engineering Software Engineering Andreas Zeller Saarland University

434 views • 18 slides
Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem Sepehr Assadi

Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem Sepehr Assadi

Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem Sepehr Assadi University of Pennsylvania Sepehr Assadi (Penn) PODS 2017 The Set Cover Problem Input: A collection of m sets S 1 , . . . , S m from a universe [ n

979 views • 97 slides

More recommend