4 papers
Some conjectures on -graphs and equivalences
Yulai Ma, Eckhard Steffen, Isaak H. Wolf +1
An -regular graph is an -graph, if every odd set of vertices is connected to its complement by at least edges. Seymour [On multicolourings of cubic graphs, and conjecture…
The perturbation threshold of degenerate graphs
Jie Han, Seonghyuk Im, Bin Wang +1
We show that for any and there exists such that the following holds: Let be an -vertex graph with at least edges and let be an -verte…
The minimum spectral radius of -saturated graphs
Junxue Zhang, Liwen Zhang
A graph is called {\em-saturated} if does not contain as a subgraph but adding any missing edge to creates a copy of . In this paper, we consider the spectral…
Perturbation of dense graphs
Jie Han, Seonghyuk Im, Bin Wang +1
In the past two decades, various properties of randomly perturbed/augmented (hyper)graphs have been intensively studied, since the model was introduced by Bohman, Frieze and Martin…