Kefan Yu

collaborators

2 papers

cs.DS2026

Testing Induced-Subgraph Freeness in Outerplanar Graphs under the Random-Neighbor Oracle

Pan Peng, Kefan Yu

We prove that, for every fixed nonempty graph $H$ , induced- $H$ -freeness is testable with $ε^{- O_{H} (1)}$ queries on outerplanar graphs with no maximum-degree bound in the $…

math.CO2023

Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $- 3$

Jack Koolen, Kefan Yu, Xiaoye Liang +2

In this paper, we classify non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $- 3$ . This is progress towards what is hoped to be an ev…

Testing Induced-Subgraph Freeness in Outerplanar Graphs under the Random-Neighbor Oracle

Non-geometric distance-regular graphs of diameter at least 3 with smallest eigenvalue at least −3

Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $- 3$