Xinyue Fan

collaborators

5 papers

math.CO2026

Crossing tournaments are polynomially $χ$ -bounded

Lila Crew, Xinyue Fan, Hidde Koerts +2

Given a tournament $T$ , Aboulker, Aubian, Charbit, and Lopes (2023) defined its clique number $ω (T)$ as the minimum clique number of a backedge graph of $T$ , and raised the que…

math.CO2026

Asymmetric induced saturation

Xinyue Fan, Sahab Hajebi, Sepehr Hajebi +1

For which graphs $H$ does there exist a graph $G$ with at least one edge and no induced subgraph isomorphic to $H$ , such that deleting any edge of $G$ creates an induced copy of $H…

math.CO2026

Decomposing tournaments into comparability graphs

Pierre Aboulker, Logan Crew, Julien Duron +7

In this note, we introduce the \emph{partial order decomposition number} of a digraph $D$ , denoted $p o d (D)$ , defined as the minimum integer $k$ such that $A(D)=A(P_1)\cup\cdots\cup…

math.CO2026

Characterizing Large Clique Number in Tournaments

Logan Crew, Xinyue Fan, Hidde Koerts +2

Aboulker, Aubian, Charbit, and Lopes (2023) defined the clique number of a tournament to be the minimum clique number of one of its backedge graphs. Here we show that if $T$ is a t…

math.CO2025

Halfway to induced saturation for even cycles

Xinyue Fan, Sahab Hajebi, Sepehr Hajebi +1

For graphs $G$ and $H$ , we say that $G$ is $H$ -free if no induced subgraph of $G$ is isomorphic to $H$ , and that $G$ is $H$ -induced-saturated if $G$ is $H$ -free but removing or add…

Crossing tournaments are polynomially χ​-bounded

Asymmetric induced saturation

Decomposing tournaments into comparability graphs

Characterizing Large Clique Number in Tournaments

Halfway to induced saturation for even cycles

Crossing tournaments are polynomially $χ$ -bounded