Jung Hon Yip

collaborators

6 papers

math.CO2026

Hadwiger's Conjecture for ${co-claw, co-gem}$ -free graphs and ${fork, antifork}$ -free graphs

Daniel Carter, Jung Hon Yip

We prove Hadwiger's Conjecture for ${co-claw, co-gem}$ -free graphs and ${fork, antifork}$ -free graphs, where the co-claw is the disjoint union of a…

math.CO2026

The Dominating 4-Colour Theorem

AntÃ³nio GirÃ£o, Freddie Illingworth, Bojan Mohar +6

A "dominating $K_{t}$ -model" in a graph $G$ is a sequence $(T_{1}, \dots, T_{t})$ of pairwise vertex-disjoint connected subgraphs of $G$ , such that whenever $1 \leq i < j \leq t$ every vertex…

math.CO2025

Verifying Hadwiger's Conjecture for Examples of Graphs with $I^\pm (G) = 2$

Jofre Costa, Eric Luu, David R. Wood +1

Hadwiger's Conjecture states that every graph with chromatic number $k$ contains a complete graph on $k$ vertices as a minor. This conjecture is a tremendous strengthening of the F…

math.CO2025

Dense Matchings of Linear Size in Graphs with Independence Number 2

Jung Hon Yip

For a real number $c > 4$ , we prove that every graph $G$ with $I^\pm (G) \leq 2$ and $∣ V (G) ∣ \geq c t$ has a matching $M$ with $∣ M ∣ = t$ such that the number of non-adjacent pairs of ed…

math.CO2025

Embedding Graphs of Simple Treewidth into Sparse Products

Kevin Hendrey, David R. Wood, Jung Hon Yip

We study embeddings of graphs with bounded treewidth or bounded simple treewidth into the undirected graph underlying the directed product of two directed graphs. If the factors ha…

math.CO2025

Treewidth 2 in the Planar Graph Product Structure Theorem

Marc Distel, Kevin Hendrey, Nikolai Karol +2

We prove that every planar graph is contained in $H_{1} ⊠ H_{2} ⊠ K_{2}$ for some graphs $H_{1}$ and $H_{2}$ both with treewidth 2. This resolves a question of Liu, Norin and W…

Hadwiger's Conjecture for {co-claw,co-gem}-free graphs and {fork,antifork}-free graphs

The Dominating 4-Colour Theorem

Verifying Hadwiger's Conjecture for Examples of Graphs with I^±(G)=2

Dense Matchings of Linear Size in Graphs with Independence Number 2

Embedding Graphs of Simple Treewidth into Sparse Products

Treewidth 2 in the Planar Graph Product Structure Theorem

Hadwiger's Conjecture for ${co-claw, co-gem}$ -free graphs and ${fork, antifork}$ -free graphs

Verifying Hadwiger's Conjecture for Examples of Graphs with $I^\pm (G) = 2$