arXiv 2106.011362021-06-23math.CO

Some remarks on even-hole-free graphs

Zi-Xia Song

备注：: The statement and proof of Theorem 2.1 were updated

英文摘要：

A vertex of a graph is bisimplicial if the set of its neighbors is the union of two cliques; a graph is quasi-line if every vertex is bisimplicial. A recent result of Chudnovsky and Seymour asserts that every non-empty even-hole-free graph has a bisimplicial vertex. Both Hadwiger's conjecture and the Erdős-Lovász Tihany conjecture have been shown to be true for quasi-line graphs, but are open for even-hole-free graphs. In this note, we prove that for all $k\ge7$, every even-hole-free graph with no $K_k$ minor is $(2k-5)$-colorable; every even-hole-free graph $G$ with $ω(G)<χ(G)=s+t-1$ satisfies the Erdős-Lovász Tihany conjecture provided that $ t\ge s> χ(G)/3$. Furthermore, we prove that every $9$-chromatic graph $G$ with $ω(G)\le 8$ has a $K_4\cup K_6$ minor. Our proofs rely heavily on the structural result of Chudnovsky and Seymour on even-hole-free graphs.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Some remarks on free arrangements

We exhibit a particular free subarrangement of a certain restriction of the Weyl arrangement of type $E_7$ and use it to give an affirmative answer to a recent conjecture by T.~Abe on the nature of additionally free and stair-free arrangements.

2019-03-02math.COmath.GR

Even-hole-free graphs still have bisimplicial vertices

A {\em hole} in a graph is an induced subgraph which is a cycle of length at least four. A hole is called {\em even} if it has an even number of vertices. An {\em even-hole-free} graph is a graph with no even holes. A vertex of a graph is {\em bisimplicial} if the set of its neighbours is the union of two cliques. In an earlier paper \cite{bisimplicial}, Addario-Berry, Havet and Reed, with the authors, claimed to prove a conjecture of Reed, that every even-hole-free graph has a bisimplicial vertex, but we have recently been shown that the "proof" has a serious error. Here we give a proof using…

2020-05-15math.CO

某些无奇环图的完美可分性与色数

The perfect divisibility and chromatic number of some odd hole-free graphs

Guangdong University of Technology（广东工业大学）；Sun Yat-sen University（中山大学）；Shanghai Maritime University（上海海事大学）

本文研究了无奇环、锤子和K_{2,3}的图的完美可分性，并给出了短孔图在不同约束下的色数上界。

2026-03-10math.CO

Borodin-Kostochka猜想对无奇洞图成立

Borodin-Kostochka Conjecture holds for odd-hole-free graphs

本文证明了Borodin-Kostochka猜想在无奇洞图上成立，即当最大度至少为9时，色数不超过最大度减1与团数的较大者。

2023-10-11math.CO

Coloring even-hole-free graphs with no star cutset

A \emph{hole} is a chordless cycle of length at least $4$. A graph is \emph{even-hole-free} if it does not contain any hole of even length as an induced subgraph. In this paper, we study the class of even-hole-free graphs with no star cutset. We give the optimal upper bound for its chromatic number in terms of clique number and a polynomial-time algorithm to color any graph in this class. The latter is, in fact, a direct consequence of our proof that this class has bounded rank-width.

2018-05-04cs.DMmath.CO

On the chromatic number of a family of odd hole free graphs

A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. A full house is a graph composed by a vertex adjacent to both ends of an edge in $K_4$ . Let $H$ be the complement of a cycle on 7 vertices. Chudnovsky et al [6] proved that every (odd hole, $K_4$)-free graph is 4-colorable and is 3-colorable if it does not has $H$ as an induced subgraph. In this paper, we use the proving technique of Chudnovsky et al to generalize this conclusion to (odd hole, full house)-free graphs, and prove that for (odd hole, full house)-free graph $G$, $χ(G)\le ω(G)+1$, and the equ…

2021-10-25cs.DMmath.CO

更多相关论文收起更多论文

The Game of Cops and Robber on (Claw, Even-hole)-free Graphs

In this paper, we study the game of cops and robber on the class of graphs with no even hole (induced cycle of even length) and claw (a star with three leaves). The cop number of a graph $G$ is defined as the minimum number of cops needed to capture the robber. Here, we prove that the cop number of all claw-free even-hole-free graphs is at most two and, in addition, the capture time is at most $2n$ rounds, where $n$ is the number of vertices of the graph. Moreover, our results can be viewed as a first step towards studying the structure of claw-free even-hole-free graphs.

2022-01-11cs.DMmath.CO

关于偶洞自由图的秩宽度

On rank-width of even-hole-free graphs

本文构造了一类无团割集的（菱形，偶洞）自由图，证明其秩宽度无界，从而否定了相关有界性猜想，并排除了应用元定理求解最大独立集问题的可能性。

2017-09-01cs.DMmath.CO

无奇洞图和无偶洞图的三明治问题

The sandwich problem for odd-hole-free and even-hole-free graphs

该研究针对无奇洞、无偶洞两类图性质，证明对应的图三明治问题均为NP难，完善了图性质三明治问题的计算复杂度分类结果。

2024-04-16cs.DMmath.CO

On the structure of (banner, odd hole)-free graphs

A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A banner is a graph which consists of a hole on four vertices and a single vertex with precisely one neighbor on the hole. We prove that a (banner, odd hole)-free graph is perfect, or does not contain a stable set on three vertices, or contains a homogeneous set. Using this structure result, we design a polynomial-time algorithm for recognizing (banner, odd hole)-free graphs. We also design polynomial-time algorithms to find, for such a graph, a minimum coloring and largest stable set. A…

2017-10-14cs.DMmath.CO

A note on coloring (even-hole,cap)-free graphs

A {\em hole} is a chordless cycle of length at least four. A hole is {\em even} (resp. {\em odd}) if it contains an even (resp. odd) number of vertices. A \emph{cap} is a graph induced by a hole with an additional vertex that is adjacent to exactly two adjacent vertices on the hole. In this note, we use a decomposition theorem by Conforti et al. (1999) to show that if a graph $G$ does not contain any even hole or cap as an induced subgraph, then $χ(G)\le \lfloor\frac{3}{2}ω(G)\rfloor$, where $χ(G)$ and $ω(G)$ are the chromatic number and the clique number of $G$, respectively. This bound is at…

2015-10-30cs.DMmath.CO

树独立数 IV. 无偶洞图

Tree Independence Number IV. Even-hole-free Graphs

本研究证明无偶洞图的树独立数至多为顶点数的多对数级，给出了对应树分解的稳定数上界，由此推导出该图类上多个NP难算法问题可在拟多项式时间内求解。

2024-07-12cs.DMcs.DSmath.CO