Short cycle covers of graphs with minimum degree three Tom Kaiser, - - PowerPoint PPT Presentation

▶
short cycle covers of graphs with minimum degree three
SMART_READER_LITE
LIVE PREVIEW

Short cycle covers of graphs with minimum degree three Tom Kaiser, - - PowerPoint PPT Presentation

Jul 07, 2023 317 likes •649 views

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

slide-1
SLIDE 1

Short cycle covers of graphs with minimum degree three

Tomáš Kaiser, Daniel Král’, Bernard Lidický and Pavel Nejedlý

Department of Applied Math Charles University

Cycles and Colourings 2008 - Tatranská Štrba

slide-2
SLIDE 2

Short cycle covers of graphs with minimum degree three

Overview - from the previous talk

  • cycle is a subgraph with all degrees even
  • circuit is a connected 2-regular graph
  • cycle cover is a set of cycles such that

each edge is contained in at least one of the cycles

  • cycle double cover is a set of cycles such that

each edge is contained in exactly two cycles Goal is to find a short cycle cover

slide-3
SLIDE 3

Short cycle covers of graphs with minimum degree three

Overview - from the previous talk

Conjecture (Alon and Tarsi, 1985)

Every m-edge bridgeless graph has a cycle cover of length at most 7m/5 = 1.4 m (SCC)

Conjecture (Seymour, 1979 and Szekeres, 1973)

Every bridgeless graph has a cycle double cover (CDC)

Theorem (Jamshy, Raspaud and Tarsi, 1989)

Every m-edge graph which admits 5-flow has a cycle cover of length at most 8m/5 = 1.6 m

Theorem (Král’, Nejedlý and Šámal, 2007+)

Every m-edge cubic graph has a cycle cover of length at most 34m/21 ≈ 1.619 m

slide-4
SLIDE 4

Short cycle covers of graphs with minimum degree three

Short Cycle Cover implies Cycle Double Cover 1/2

  • reduction due to Jamshy and Tarsi (1992)
  • CDC is enough to prove for cubic bridgeless graphs

(splitting vertices, contracting 2-vertices)

  • the Petersen graph has SCC of length 7m/5
slide-5
SLIDE 5

Short cycle covers of graphs with minimum degree three

Short Cycle Cover implies Cycle Double Cover 2/2

  • replace every vertex of a cubic graph G by part of Petersen
slide-6
SLIDE 6

Short cycle covers of graphs with minimum degree three

slide-7
SLIDE 7

Short cycle covers of graphs with minimum degree three

Short Cycle Cover implies Cycle Double Cover 2/2

  • replace every vertex of a cubic graph G by part of Petersen
  • find SCC - necessary behaves like on Petersen
  • convert SCC back to G, edges covered by 1 or 2 cycles
  • remove edges covered twice, the resulting graph is another

cycle

slide-8
SLIDE 8

Short cycle covers of graphs with minimum degree three

Short Cycle Cover implies Cycle Double Cover 2/2

  • replace every vertex of a cubic graph G by part of Petersen
  • find SCC - necessary behaves like on Petersen
  • convert SCC back to G, edges covered by 1 or 2 cycles
  • remove edges covered twice, the resulting graph is another

cycle

slide-9
SLIDE 9

Short cycle covers of graphs with minimum degree three

Short Cycle Cover implies Cycle Double Cover 2/2

  • replace every vertex of a cubic graph G by part of Petersen
  • find SCC - necessary behaves like on Petersen
  • convert SCC back to G, edges covered by 1 or 2 cycles
  • remove edges covered twice, the resulting graph is another

cycle

slide-10
SLIDE 10

Short cycle covers of graphs with minimum degree three

Bridgeless graphs with mindegree three

Theorem (Kaiser, Král, L., Nejedlý, 2007+)

Bridgeless graph G = (V, E) with mindegree three has a cycle cover of length at most 44m/27 ≈ 1.630 m.

Theorem (Alon and Tarsi, 1985 or Bermond, Jackson and Jaeger 1983)

Bridgeless graph G = (V, E) has a cycle cover of length at most 5m/3 ≈ 1.666 m.

slide-11
SLIDE 11

Short cycle covers of graphs with minimum degree three

Bridgeless graphs with mindegree three

Theorem (Kaiser, Král, L., Nejedlý, 2007+)

Bridgeless graph G = (V, E) with mindegree three has a cycle cover of length at most 44m/27 ≈ 1.630 m.

Theorem (Alon and Tarsi, 1985 or Bermond, Jackson and Jaeger 1983)

Bridgeless graph G = (V, E) has a cycle cover of length at most 5m/3 ≈ 1.666 m.

slide-12
SLIDE 12

Short cycle covers of graphs with minimum degree three

Bridgeless graphs

  • splitting vertices of degree ≥ 4 (preserving bridgelessness)
  • suppress 2-vertices and add weights to edges

(cubic graph), w is sum of all weigths

  • create rainbow 2-factor
  • find a matching of weight ≤ w/3 and 2-factor F
  • contract F and obtain nowhere-zero-4-flow
  • create three covering cycles
  • compute the total length of cover
slide-13
SLIDE 13

Short cycle covers of graphs with minimum degree three

Bridgeless graphs

  • splitting vertices of degree ≥ 4 (preserving bridgelessness)
  • suppress 2-vertices and add weights to edges

(cubic graph), w is sum of all weigths

3 1

  • create rainbow 2-factor
  • find a matching of weight ≤ w/3 and 2-factor F
  • contract F and obtain nowhere-zero-4-flow
  • create three covering cycles
  • compute the total length of cover
slide-14
SLIDE 14

Short cycle covers of graphs with minimum degree three

Bridgeless graphs

  • splitting vertices of degree ≥ 4 (preserving bridgelessness)
  • suppress 2-vertices and add weights to edges

(cubic graph), w is sum of all weigths

  • create rainbow 2-factor
  • find a matching of weight ≤ w/3 and 2-factor F
  • contract F and obtain nowhere-zero-4-flow
  • create three covering cycles
  • compute the total length of cover
slide-15
SLIDE 15

Short cycle covers of graphs with minimum degree three

Bridgeless graphs

  • splitting vertices of degree ≥ 4 (preserving bridgelessness)
  • suppress 2-vertices and add weights to edges

(cubic graph), w is sum of all weigths

  • create rainbow 2-factor
  • find a matching of weight ≤ w/3 and 2-factor F
  • contract F and obtain nowhere-zero-4-flow
  • create three covering cycles
  • compute the total length of cover
slide-16
SLIDE 16

Short cycle covers of graphs with minimum degree three

Bridgeless graphs

  • splitting vertices of degree ≥ 4 (preserving bridgelessness)
  • suppress 2-vertices and add weights to edges

(cubic graph), w is sum of all weigths

  • create rainbow 2-factor
  • find a matching of weight ≤ w/3 and 2-factor F
  • contract F and obtain nowhere-zero-4-flow
  • create three covering cycles
  • compute the total length of cover
slide-17
SLIDE 17

Short cycle covers of graphs with minimum degree three

Bridgeless graphs

  • splitting vertices of degree ≥ 4 (preserving bridgelessness)
  • suppress 2-vertices and add weights to edges

(cubic graph), w is sum of all weigths

  • create rainbow 2-factor
  • find a matching of weight ≤ w/3 and 2-factor F
  • contract F and obtain nowhere-zero-4-flow
  • create three covering cycles
  • compute the total length of cover
slide-18
SLIDE 18

Short cycle covers of graphs with minimum degree three

Local view on one cycle

slide-19
SLIDE 19

Short cycle covers of graphs with minimum degree three

Local view on one cycle

slide-20
SLIDE 20

Short cycle covers of graphs with minimum degree three

Local view on one cycle

slide-21
SLIDE 21

Short cycle covers of graphs with minimum degree three

Local view on one cycle

slide-22
SLIDE 22

Short cycle covers of graphs with minimum degree three

Local view on one cycle

slide-23
SLIDE 23

Short cycle covers of graphs with minimum degree three

Local view on one cycle

slide-24
SLIDE 24

Short cycle covers of graphs with minimum degree three

Local view on one cycle

slide-25
SLIDE 25

Short cycle covers of graphs with minimum degree three

Local view on one cycle

slide-26
SLIDE 26

Short cycle covers of graphs with minimum degree three

A little bit of computation

  • assume r ≤ g ≤ b
  • assume r + g + b ≤ m/3
  • usage 3r, 2g, b and 3/2F.
  • size of the cover:

3r+2g+b+3/2F = 2(r+g+b)+3/2F = 3m/2+m/6 = 5m/3

slide-27
SLIDE 27

Short cycle covers of graphs with minimum degree three

Bridgeless graphs with mindegree three - improvements

  • combination of two cycle covers
  • little bit unfriendly to vertices of degree two
  • unable to split 4-vertices (expading)
  • improve the nowhere-zero-4-flow
slide-28
SLIDE 28

Short cycle covers of graphs with minimum degree three

Bridgeless graphs with mindegree three - improvements

  • combination of two cycle covers
  • little bit unfriendly to vertices of degree two
  • unable to split 4-vertices (expading)
  • improve the nowhere-zero-4-flow
slide-29
SLIDE 29

Short cycle covers of graphs with minimum degree three

Bridgeless graphs with mindegree three - improvements

  • combination of two cycle covers
  • little bit unfriendly to vertices of degree two
  • unable to split 4-vertices (expading)
  • improve the nowhere-zero-4-flow
slide-30
SLIDE 30

Short cycle covers of graphs with minimum degree three

Bridgeless graphs with mindegree three - improvements

  • combination of two cycle covers
  • little bit unfriendly to vertices of degree two
  • unable to split 4-vertices (expading)
  • improve the nowhere-zero-4-flow
slide-31
SLIDE 31

Short cycle covers of graphs with minimum degree three

slide-32
SLIDE 32

Short cycle covers of graphs with minimum degree three

Thank you for your attention