Lanchao Wang

collaborators

3 papers

math.CO2023

The hat guessing number of random graphs with constant edge-chosen probability

Lanchao Wang, Yaojun Chen

Let $G$ be a graph with $n$ vertices. The {\em hat guessing number} of $G$ is defined in terms of the following game: There are $n$ players and one opponent. The opponent will wear…

math.CO2023

Connectedness of friends-and-strangers graphs of complete bipartite graphs and others

Lanchao Wang, Junying Lu, Yaojun Chen

Let $X$ and $Y$ be any two graphs of order $n$ . The friends-and-strangers graph $FS (X, Y)$ of $X$ and $Y$ is a graph with vertex set consisting of all bijections $σ:V(X) \m…

math.CO2022

Connectivity of friends-and-strangers graphs on random pairs

Lanchao Wang, Yaojun Chen

Consider two graphs $X$ and $Y$ , each with $n$ vertices. The friends-and-strangers graph $FS (X, Y)$ of $X$ and $Y$ is a graph with vertex set consisting of all bijections $…