Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1309.0119

Graphes parfaits : structure et algorithmes

Nicolas Trotignon
View original source ↗Read source document ↗Export metadata ↓

Abstract

This work is the PhD thesis of Nicolas Trotignon, written in 2004 under the supervision of Frédéric Maffray. It is motivated by the desire for a better understanding of perfect graphs. The proof of the Claude Berge's perfect graph conjecture in 2002 by Chudnovsky, Robertson, Seymour and Thomas has shed a new light on this field of combinatorics. But some questions are still unsettled, particulary the existence of a combinatorial algorithm for the coloring of perfect graphs. An even pair of a graph is a pair of vertices such that every path joining them has even length. As proved by Fonlupt and Uhry, the contraction of an even pair preserves the chromatic number, and when applied recursively may lead to an optimal coloring. We prove a conjecture of Everett and Reed saying that this method works for a class of perfect graphs: Artemis graphs. This yields a coloring algorithm for Artemis graphs with complexity $O(n^2m)$. We give an $O(n^9)$ algorithm for the recognition of Artemis graphs. Other recognition algorithms are also given, each of them based on subgraph detection routines for Berge graphs. We show that these subgraph detection problems are NP-complete when extended to general graphs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolas Trotignon. 2013-08-31. Graphes parfaits : structure et algorithmes. https://arxiv.org/abs/1309.0119

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗