W. Ge

collaborators

4 papers

math.CO2025

Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity

Steffen Borgwardt, MacKenzie Carr, Ce Chen +4

Fomin, Kratochvíl, Lokshtanov, Mancini, and Telle showed that every $C_{4}$ -free graph is reconstructible from the \emph{multiset} of closed neighborhoods. We strengthen their resu…

math.CO2025

Super-minimally $3$ -connected graphs

Wayne Ge

In this paper, we introduce super-minimally $k$ -connected graphs, those $k$ -connected graphs in which no proper subgraph is $k$ -connected. For $k$ greater than or equal to three, t…

math.CO2025

Rainbow triangles and the Erdős-Hajnal problem in projective geometries

Carolyn Chun, James Dylan Douthitt, Wayne Ge +3

We formulate a geometric version of the Erdős-Hajnal conjecture that applies to finite projective geometries rather than graphs, in both its usual 'induced' form and the multicolou…

math.CO2025

Unavoidable cycle-contraction minors of large $2$ -connected graphs

Wayne Ge, James Oxley

It is well known that every sufficiently large connected graph has, as an induced subgraph, $K_{n}$ , $K_{1, n}$ , or an $n$ -vertex path. A 2023 paper of Allred, Ding, and Oporowski ide…

Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity

Super-minimally 3-connected graphs

Rainbow triangles and the Erdős-Hajnal problem in projective geometries

Unavoidable cycle-contraction minors of large 2-connected graphs

Super-minimally $3$ -connected graphs

Unavoidable cycle-contraction minors of large $2$ -connected graphs