Showing math.COShow all
3 papers · 1 filter
math.CO2024
Structure of tight (k,0)-stable graphs
Dingding Dong, Sammy Luo
We say that a graph G is -stable if removing vertices from it reduces its independence number by at most . We say that G is tight -stable if it is $(k…
math.CO2023
A new shift operator-based polynomial method in additive combinatorics
Sammy Luo
We introduce a new form of the polynomial method based on what we call "shift operators," which we use to give efficient and intuitive new proofs of results previously shown using…
math.CO2022
On random irregular subgraphs
Jacob Fox, Sammy Luo, Huy Tuan Pham
Let be a -regular graph on vertices. Frieze, Gould, Karoński and Pfender began the study of the following random spanning subgraph model . Assign independently t…