double-critical graph conjecture for claw-free graphs · c : v(g) !f1;:::;tgsuch that c(u) 6= c(v)...
TRANSCRIPT
![Page 1: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/1.jpg)
IntroductionResults on double-critical graphs
Double-critical graph conjecture for claw-freegraphs
Martin RolekJoint work with Zi-Xia Song
University of Central Florida
Shanks Workshop: 29th Cumberland Conference
on Combinatorics, Graph Theory, and Computing
Vanderbilt University
May 20, 2017
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 2: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/2.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
All graphs considered have no loops and no multiple edges.
A graph is t-colorable if there exists a functionc : V (G )→ {1, . . . , t} such that c(u) 6= c(v) for all edgesuv ∈ E (G ).
χ(G ) := min{t : G is t-colorable}.A graph G is t-chromatic if χ(G ) = t.
ω(G ) := max{t : Kt ⊆ G}.χ(G ) ≥ ω(G ), and equality holds for many graphs, i.e.perfect graphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 3: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/3.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
All graphs considered have no loops and no multiple edges.
A graph is t-colorable if there exists a functionc : V (G )→ {1, . . . , t} such that c(u) 6= c(v) for all edgesuv ∈ E (G ).
χ(G ) := min{t : G is t-colorable}.A graph G is t-chromatic if χ(G ) = t.
ω(G ) := max{t : Kt ⊆ G}.χ(G ) ≥ ω(G ), and equality holds for many graphs, i.e.perfect graphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 4: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/4.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
All graphs considered have no loops and no multiple edges.
A graph is t-colorable if there exists a functionc : V (G )→ {1, . . . , t} such that c(u) 6= c(v) for all edgesuv ∈ E (G ).
χ(G ) := min{t : G is t-colorable}.
A graph G is t-chromatic if χ(G ) = t.
ω(G ) := max{t : Kt ⊆ G}.χ(G ) ≥ ω(G ), and equality holds for many graphs, i.e.perfect graphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 5: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/5.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
All graphs considered have no loops and no multiple edges.
A graph is t-colorable if there exists a functionc : V (G )→ {1, . . . , t} such that c(u) 6= c(v) for all edgesuv ∈ E (G ).
χ(G ) := min{t : G is t-colorable}.A graph G is t-chromatic if χ(G ) = t.
ω(G ) := max{t : Kt ⊆ G}.χ(G ) ≥ ω(G ), and equality holds for many graphs, i.e.perfect graphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 6: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/6.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
All graphs considered have no loops and no multiple edges.
A graph is t-colorable if there exists a functionc : V (G )→ {1, . . . , t} such that c(u) 6= c(v) for all edgesuv ∈ E (G ).
χ(G ) := min{t : G is t-colorable}.A graph G is t-chromatic if χ(G ) = t.
ω(G ) := max{t : Kt ⊆ G}.
χ(G ) ≥ ω(G ), and equality holds for many graphs, i.e.perfect graphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 7: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/7.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
All graphs considered have no loops and no multiple edges.
A graph is t-colorable if there exists a functionc : V (G )→ {1, . . . , t} such that c(u) 6= c(v) for all edgesuv ∈ E (G ).
χ(G ) := min{t : G is t-colorable}.A graph G is t-chromatic if χ(G ) = t.
ω(G ) := max{t : Kt ⊆ G}.χ(G ) ≥ ω(G ), and equality holds for many graphs, i.e.perfect graphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 8: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/8.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Question - Erdos (1968)
If χ(G ) = 3t, then it is trivial to show G contains t vertex-disjointodd cycles.Is it true for t ≥ 2 that every (3t − 1)-chromatic critical graph withsufficiently many vertices contains t vertex-disjoint odd cycles?
(3t − 2)-chromatic critical graphs may not have tvertex-disjoint odd cycles (Gallai 1968, t = 2)
Is it true that every 5-chromatic critical graph with sufficientlymany vertices contains two vertex-disjoint odd cycles?
If a 5-chromatic graph contains two vertex disjoint odd cycles,then it has two disjoint 3-chromatic subgraphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 9: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/9.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Question - Erdos (1968)
If χ(G ) = 3t, then it is trivial to show G contains t vertex-disjointodd cycles.Is it true for t ≥ 2 that every (3t − 1)-chromatic critical graph withsufficiently many vertices contains t vertex-disjoint odd cycles?
(3t − 2)-chromatic critical graphs may not have tvertex-disjoint odd cycles (Gallai 1968, t = 2)
Is it true that every 5-chromatic critical graph with sufficientlymany vertices contains two vertex-disjoint odd cycles?
If a 5-chromatic graph contains two vertex disjoint odd cycles,then it has two disjoint 3-chromatic subgraphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 10: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/10.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Question - Erdos (1968)
If χ(G ) = 3t, then it is trivial to show G contains t vertex-disjointodd cycles.Is it true for t ≥ 2 that every (3t − 1)-chromatic critical graph withsufficiently many vertices contains t vertex-disjoint odd cycles?
(3t − 2)-chromatic critical graphs may not have tvertex-disjoint odd cycles (Gallai 1968, t = 2)
Is it true that every 5-chromatic critical graph with sufficientlymany vertices contains two vertex-disjoint odd cycles?
If a 5-chromatic graph contains two vertex disjoint odd cycles,then it has two disjoint 3-chromatic subgraphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 11: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/11.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Question - Erdos (1968)
If χ(G ) = 3t, then it is trivial to show G contains t vertex-disjointodd cycles.Is it true for t ≥ 2 that every (3t − 1)-chromatic critical graph withsufficiently many vertices contains t vertex-disjoint odd cycles?
(3t − 2)-chromatic critical graphs may not have tvertex-disjoint odd cycles (Gallai 1968, t = 2)
Is it true that every 5-chromatic critical graph with sufficientlymany vertices contains two vertex-disjoint odd cycles?
If a 5-chromatic graph contains two vertex disjoint odd cycles,then it has two disjoint 3-chromatic subgraphs.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 12: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/12.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 13: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/13.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 14: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/14.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
True for (s, t) = (2, 2) (easy)
True for (s, t) = (2, 3) (Brown and Jung 1969)
True for (s, t) = (2, 4) (Mozhan 1987; Stiebitz 1987)
True for (s, t) = (3, 3), (3, 4), (3, 5) (Stiebitz 1987)
True for line graphs (Kostochka and Stiebitz 2008)
True for quasi-line graphs, and true for graphs with α(G ) = 2(Balogh, Kostochka, Prince, and Stiebitz 2009)
Otherwise fairly wide open
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 15: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/15.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
True for (s, t) = (2, 2) (easy)
True for (s, t) = (2, 3) (Brown and Jung 1969)
True for (s, t) = (2, 4) (Mozhan 1987; Stiebitz 1987)
True for (s, t) = (3, 3), (3, 4), (3, 5) (Stiebitz 1987)
True for line graphs (Kostochka and Stiebitz 2008)
True for quasi-line graphs, and true for graphs with α(G ) = 2(Balogh, Kostochka, Prince, and Stiebitz 2009)
Otherwise fairly wide open
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 16: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/16.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
True for (s, t) = (2, 2) (easy)
True for (s, t) = (2, 3) (Brown and Jung 1969)
True for (s, t) = (2, 4) (Mozhan 1987; Stiebitz 1987)
True for (s, t) = (3, 3), (3, 4), (3, 5) (Stiebitz 1987)
True for line graphs (Kostochka and Stiebitz 2008)
True for quasi-line graphs, and true for graphs with α(G ) = 2(Balogh, Kostochka, Prince, and Stiebitz 2009)
Otherwise fairly wide open
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 17: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/17.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
True for (s, t) = (2, 2) (easy)
True for (s, t) = (2, 3) (Brown and Jung 1969)
True for (s, t) = (2, 4) (Mozhan 1987; Stiebitz 1987)
True for (s, t) = (3, 3), (3, 4), (3, 5) (Stiebitz 1987)
True for line graphs (Kostochka and Stiebitz 2008)
True for quasi-line graphs, and true for graphs with α(G ) = 2(Balogh, Kostochka, Prince, and Stiebitz 2009)
Otherwise fairly wide open
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 18: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/18.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
True for (s, t) = (2, 2) (easy)
True for (s, t) = (2, 3) (Brown and Jung 1969)
True for (s, t) = (2, 4) (Mozhan 1987; Stiebitz 1987)
True for (s, t) = (3, 3), (3, 4), (3, 5) (Stiebitz 1987)
True for line graphs (Kostochka and Stiebitz 2008)
True for quasi-line graphs, and true for graphs with α(G ) = 2(Balogh, Kostochka, Prince, and Stiebitz 2009)
Otherwise fairly wide open
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 19: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/19.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
True for (s, t) = (2, 2) (easy)
True for (s, t) = (2, 3) (Brown and Jung 1969)
True for (s, t) = (2, 4) (Mozhan 1987; Stiebitz 1987)
True for (s, t) = (3, 3), (3, 4), (3, 5) (Stiebitz 1987)
True for line graphs (Kostochka and Stiebitz 2008)
True for quasi-line graphs, and true for graphs with α(G ) = 2(Balogh, Kostochka, Prince, and Stiebitz 2009)
Otherwise fairly wide open
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 20: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/20.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
True for (s, t) = (2, 2) (easy)
True for (s, t) = (2, 3) (Brown and Jung 1969)
True for (s, t) = (2, 4) (Mozhan 1987; Stiebitz 1987)
True for (s, t) = (3, 3), (3, 4), (3, 5) (Stiebitz 1987)
True for line graphs (Kostochka and Stiebitz 2008)
True for quasi-line graphs, and true for graphs with α(G ) = 2(Balogh, Kostochka, Prince, and Stiebitz 2009)
Otherwise fairly wide open
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 21: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/21.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
If we fix s = 2, the conjecture claims there exists an edge uvsuch that χ(G − u − v) ≥ χ(G )− 1.
A connected graph G is double-critical if for every edgeuv ∈ E (G ), χ(G − u − v) = χ(G )− 2.
Double-Critical Graph Conjecture (Erdos and Lovasz 1968)
For every t ≥ 1, the only double-critical, t-chromatic graph is Kt .
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 22: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/22.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
If we fix s = 2, the conjecture claims there exists an edge uvsuch that χ(G − u − v) ≥ χ(G )− 1.
A connected graph G is double-critical if for every edgeuv ∈ E (G ), χ(G − u − v) = χ(G )− 2.
Double-Critical Graph Conjecture (Erdos and Lovasz 1968)
For every t ≥ 1, the only double-critical, t-chromatic graph is Kt .
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 23: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/23.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Erdos-Lovasz Tihany Conjecture (1968)
Let G be a graph with χ(G ) > ω(G ), and let s, t ≥ 2 be integerssuch that χ(G ) = s + t − 1. Then G contains two disjointsubgraphs H1 and H2 such that χ(H1) ≥ s and χ(H2) ≥ t.
If we fix s = 2, the conjecture claims there exists an edge uvsuch that χ(G − u − v) ≥ χ(G )− 1.
A connected graph G is double-critical if for every edgeuv ∈ E (G ), χ(G − u − v) = χ(G )− 2.
Double-Critical Graph Conjecture (Erdos and Lovasz 1968)
For every t ≥ 1, the only double-critical, t-chromatic graph is Kt .
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 24: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/24.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Double-Critical Graph Conjecture (Erdos and Lovasz 1968)
For every t ≥ 1, the only double-critical, t-chromatic graph is Kt .
Special case s = 2 of Erdos-Lovasz Tihany Conjecture.
True for line graphs, quasi-line graphs, and true for graphswith α(G ) = 2 (Kostochka and Stiebitz 2008; Balogh,Kostochka, Prince, and Stiebitz 2009)
True for t ≤ 5 (Brown and Jung 1969; Mozhan 1987;Stiebitz 1987)
Open for t ≥ 6.
Not yet known if a double critical, t-chromatic graph G 6= Kt
contains a K4 subgraph for t ≥ 6.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 25: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/25.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Double-Critical Graph Conjecture (Erdos and Lovasz 1968)
For every t ≥ 1, the only double-critical, t-chromatic graph is Kt .
Special case s = 2 of Erdos-Lovasz Tihany Conjecture.
True for line graphs, quasi-line graphs, and true for graphswith α(G ) = 2 (Kostochka and Stiebitz 2008; Balogh,Kostochka, Prince, and Stiebitz 2009)
True for t ≤ 5 (Brown and Jung 1969; Mozhan 1987;Stiebitz 1987)
Open for t ≥ 6.
Not yet known if a double critical, t-chromatic graph G 6= Kt
contains a K4 subgraph for t ≥ 6.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 26: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/26.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Double-Critical Graph Conjecture (Erdos and Lovasz 1968)
For every t ≥ 1, the only double-critical, t-chromatic graph is Kt .
Special case s = 2 of Erdos-Lovasz Tihany Conjecture.
True for line graphs, quasi-line graphs, and true for graphswith α(G ) = 2 (Kostochka and Stiebitz 2008; Balogh,Kostochka, Prince, and Stiebitz 2009)
True for t ≤ 5 (Brown and Jung 1969; Mozhan 1987;Stiebitz 1987)
Open for t ≥ 6.
Not yet known if a double critical, t-chromatic graph G 6= Kt
contains a K4 subgraph for t ≥ 6.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 27: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/27.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Double-Critical Graph Conjecture (Erdos and Lovasz 1968)
For every t ≥ 1, the only double-critical, t-chromatic graph is Kt .
Special case s = 2 of Erdos-Lovasz Tihany Conjecture.
True for line graphs, quasi-line graphs, and true for graphswith α(G ) = 2 (Kostochka and Stiebitz 2008; Balogh,Kostochka, Prince, and Stiebitz 2009)
True for t ≤ 5 (Brown and Jung 1969; Mozhan 1987;Stiebitz 1987)
Open for t ≥ 6.
Not yet known if a double critical, t-chromatic graph G 6= Kt
contains a K4 subgraph for t ≥ 6.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 28: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/28.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
Double-Critical Graph Conjecture (Erdos and Lovasz 1968)
For every t ≥ 1, the only double-critical, t-chromatic graph is Kt .
Special case s = 2 of Erdos-Lovasz Tihany Conjecture.
True for line graphs, quasi-line graphs, and true for graphswith α(G ) = 2 (Kostochka and Stiebitz 2008; Balogh,Kostochka, Prince, and Stiebitz 2009)
True for t ≤ 5 (Brown and Jung 1969; Mozhan 1987;Stiebitz 1987)
Open for t ≥ 6.
Not yet known if a double critical, t-chromatic graph G 6= Kt
contains a K4 subgraph for t ≥ 6.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 29: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/29.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
A graph is claw-free if it does not contain K1,3 as an inducedsubgraph.
Theorem - Huang and Yu (2016+)
If G is a claw-free, double-critical, 6-chromatic graph, thenG = K6.
Theorem - R. and Song (2017)
For t ∈ {6, 7, 8}, if G is a claw-free, double-critical, t-chromaticgraph, then G = Kt .
For t = 6, our proof is different and shorter.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 30: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/30.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
A graph is claw-free if it does not contain K1,3 as an inducedsubgraph.
Theorem - Huang and Yu (2016+)
If G is a claw-free, double-critical, 6-chromatic graph, thenG = K6.
Theorem - R. and Song (2017)
For t ∈ {6, 7, 8}, if G is a claw-free, double-critical, t-chromaticgraph, then G = Kt .
For t = 6, our proof is different and shorter.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 31: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/31.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
A graph is claw-free if it does not contain K1,3 as an inducedsubgraph.
Theorem - Huang and Yu (2016+)
If G is a claw-free, double-critical, 6-chromatic graph, thenG = K6.
Theorem - R. and Song (2017)
For t ∈ {6, 7, 8}, if G is a claw-free, double-critical, t-chromaticgraph, then G = Kt .
For t = 6, our proof is different and shorter.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 32: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/32.jpg)
IntroductionResults on double-critical graphs
DefinitionsErdos-Lovasz Tihany conjectureDouble-critical graph conjecture
A graph is claw-free if it does not contain K1,3 as an inducedsubgraph.
Theorem - Huang and Yu (2016+)
If G is a claw-free, double-critical, 6-chromatic graph, thenG = K6.
Theorem - R. and Song (2017)
For t ∈ {6, 7, 8}, if G is a claw-free, double-critical, t-chromaticgraph, then G = Kt .
For t = 6, our proof is different and shorter.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 33: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/33.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Proposition (Kawarabayashi, Pedersen, and Toft 2011)
Suppose G is a non-complete, double-critical, t-chromatic graph.Then the following are true:
δ(G ) ≥ t + 1.
Every edge belongs to at least t − 2 triangles.
If x ∈ V (G ) such that d(x) < |V (G )| − 1, thenχ(G [N(x)]) ≤ t − 3.
If d(x) = t + 1, then G [N(x)] consists only of isolatedvertices and/or disjoint cycles of length at least 5.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 34: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/34.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Theorem - Kawarabayashi, Pedersen, and Toft (2010)
If G is a non-complete, double-critical, t-chromatic graph, then notwo vertices of degree t + 1 are adjacent.
Theorem - R. and Song (2017)
If G is a non-complete, double-critical, t-chromatic graph, then novertex of degree t + 1 is adjacent to any vertex of degree ≤ t + 3.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 35: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/35.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Theorem - Kawarabayashi, Pedersen, and Toft (2010)
If G is a non-complete, double-critical, t-chromatic graph, then notwo vertices of degree t + 1 are adjacent.
Theorem - R. and Song (2017)
If G is a non-complete, double-critical, t-chromatic graph, then novertex of degree t + 1 is adjacent to any vertex of degree ≤ t + 3.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 36: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/36.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Proposition - R. and Song (2017)
If G is a non-complete, double-critical, t-chromatic claw-freegraph, then for any x ∈ V (G ), d(x) ≤ 2t − 4. Furthermore, ifd(x) < |V (G )| − 1, then d(x) ≤ 2t − 6.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 37: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/37.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Proposition - R. and Song (2017)
If G is a non-complete, double-critical, t-chromatic claw-freegraph, then for any x ∈ V (G ), d(x) ≤ 2t − 4. Furthermore, ifd(x) < |V (G )| − 1, then d(x) ≤ 2t − 6.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 38: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/38.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Theorem (R. and Song 2017)
If G is a claw-free, double-critical, t-chromatic graph fort ∈ {6, 7, 8}, then G = Kt .
Proof sketch.
Suppose G is claw-free, double-critical, t-chromatic andG 6= Kt , and let x ∈ V (G ) such that d(x) = δ(x).
t + 1 ≤ d(x) ≤ 2t − 6, and so t ≥ 7.
If t = 7, then G is 8-regular, contradicting that vertices ofdegree t + 1 are not adjacent.
If t = 8, then no vertex of degree 9 is adjacent to a vertex ofdegree 9 or 10. Hence, G is 10-regular.
By examining the structure of N(x), we find a claw.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 39: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/39.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Theorem (R. and Song 2017)
If G is a claw-free, double-critical, t-chromatic graph fort ∈ {6, 7, 8}, then G = Kt .
Proof sketch.
Suppose G is claw-free, double-critical, t-chromatic andG 6= Kt , and let x ∈ V (G ) such that d(x) = δ(x).
t + 1 ≤ d(x) ≤ 2t − 6, and so t ≥ 7.
If t = 7, then G is 8-regular, contradicting that vertices ofdegree t + 1 are not adjacent.
If t = 8, then no vertex of degree 9 is adjacent to a vertex ofdegree 9 or 10. Hence, G is 10-regular.
By examining the structure of N(x), we find a claw.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 40: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/40.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Theorem (R. and Song 2017)
If G is a claw-free, double-critical, t-chromatic graph fort ∈ {6, 7, 8}, then G = Kt .
Proof sketch.
Suppose G is claw-free, double-critical, t-chromatic andG 6= Kt , and let x ∈ V (G ) such that d(x) = δ(x).
t + 1 ≤ d(x) ≤ 2t − 6, and so t ≥ 7.
If t = 7, then G is 8-regular, contradicting that vertices ofdegree t + 1 are not adjacent.
If t = 8, then no vertex of degree 9 is adjacent to a vertex ofdegree 9 or 10. Hence, G is 10-regular.
By examining the structure of N(x), we find a claw.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 41: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/41.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Theorem (R. and Song 2017)
If G is a claw-free, double-critical, t-chromatic graph fort ∈ {6, 7, 8}, then G = Kt .
Proof sketch.
Suppose G is claw-free, double-critical, t-chromatic andG 6= Kt , and let x ∈ V (G ) such that d(x) = δ(x).
t + 1 ≤ d(x) ≤ 2t − 6, and so t ≥ 7.
If t = 7, then G is 8-regular, contradicting that vertices ofdegree t + 1 are not adjacent.
If t = 8, then no vertex of degree 9 is adjacent to a vertex ofdegree 9 or 10. Hence, G is 10-regular.
By examining the structure of N(x), we find a claw.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 42: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/42.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Theorem (R. and Song 2017)
If G is a claw-free, double-critical, t-chromatic graph fort ∈ {6, 7, 8}, then G = Kt .
Proof sketch.
Suppose G is claw-free, double-critical, t-chromatic andG 6= Kt , and let x ∈ V (G ) such that d(x) = δ(x).
t + 1 ≤ d(x) ≤ 2t − 6, and so t ≥ 7.
If t = 7, then G is 8-regular, contradicting that vertices ofdegree t + 1 are not adjacent.
If t = 8, then no vertex of degree 9 is adjacent to a vertex ofdegree 9 or 10. Hence, G is 10-regular.
By examining the structure of N(x), we find a claw.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 43: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/43.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Theorem (R. and Song 2017)
If G is a claw-free, double-critical, t-chromatic graph fort ∈ {6, 7, 8}, then G = Kt .
Proof sketch.
Suppose G is claw-free, double-critical, t-chromatic andG 6= Kt , and let x ∈ V (G ) such that d(x) = δ(x).
t + 1 ≤ d(x) ≤ 2t − 6, and so t ≥ 7.
If t = 7, then G is 8-regular, contradicting that vertices ofdegree t + 1 are not adjacent.
If t = 8, then no vertex of degree 9 is adjacent to a vertex ofdegree 9 or 10. Hence, G is 10-regular.
By examining the structure of N(x), we find a claw.
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 44: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/44.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Question
Is it true that the only claw-free, double-critical, 9-chromatic graphis K9? Is it true that any claw-free, double-critical, t-chromaticgraph is Kt for all t?
For the case t = 9, our results show that any such graph Gmust contain only of vertices of degrees 11 and 12.
Question
In a double-critical, t chromatic graph, no vertex of degree t + i isadjacent to a vertex of t + j for (i , j) ∈ {(1, 1), (1, 2), (1, 3)}. Canany other pairs be found? (2, 2)? (2, 3)?
Question
Is it true that the only double-critical, 6-chromatic graph is K6?
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 45: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/45.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Question
Is it true that the only claw-free, double-critical, 9-chromatic graphis K9? Is it true that any claw-free, double-critical, t-chromaticgraph is Kt for all t?
For the case t = 9, our results show that any such graph Gmust contain only of vertices of degrees 11 and 12.
Question
In a double-critical, t chromatic graph, no vertex of degree t + i isadjacent to a vertex of t + j for (i , j) ∈ {(1, 1), (1, 2), (1, 3)}. Canany other pairs be found? (2, 2)? (2, 3)?
Question
Is it true that the only double-critical, 6-chromatic graph is K6?
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 46: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/46.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Question
Is it true that the only claw-free, double-critical, 9-chromatic graphis K9? Is it true that any claw-free, double-critical, t-chromaticgraph is Kt for all t?
For the case t = 9, our results show that any such graph Gmust contain only of vertices of degrees 11 and 12.
Question
In a double-critical, t chromatic graph, no vertex of degree t + i isadjacent to a vertex of t + j for (i , j) ∈ {(1, 1), (1, 2), (1, 3)}. Canany other pairs be found? (2, 2)? (2, 3)?
Question
Is it true that the only double-critical, 6-chromatic graph is K6?
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 47: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/47.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Question
Is it true that the only claw-free, double-critical, 9-chromatic graphis K9? Is it true that any claw-free, double-critical, t-chromaticgraph is Kt for all t?
For the case t = 9, our results show that any such graph Gmust contain only of vertices of degrees 11 and 12.
Question
In a double-critical, t chromatic graph, no vertex of degree t + i isadjacent to a vertex of t + j for (i , j) ∈ {(1, 1), (1, 2), (1, 3)}. Canany other pairs be found? (2, 2)? (2, 3)?
Question
Is it true that the only double-critical, 6-chromatic graph is K6?
Martin Rolek Double-critical graph conjecture for claw-free graphs
![Page 48: Double-critical graph conjecture for claw-free graphs · c : V(G) !f1;:::;tgsuch that c(u) 6= c(v) for all edges uv 2E(G). ˜(G) := minft : G is t-colorableg. A graph G is t-chromatic](https://reader034.vdocuments.site/reader034/viewer/2022052001/60142fdf6b2691027f36e963/html5/thumbnails/48.jpg)
IntroductionResults on double-critical graphs
General properties of non-complete, double-critical graphsClaw-free, non-complete, double-critical graphsOpen problems
Thank you!
Martin Rolek Double-critical graph conjecture for claw-free graphs