3 papers
math.CO2023
Resilience for Loose Hamilton Cycles
José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang +2
We study the emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum -degree threshold for loose Hamiltonicity relative to…
math.CO2020
Testing linear inequalities of subgraph statistics
Lior Gishboliner, Asaf Shapira, Henrique Stagni
Property testers are fast randomized algorithms whose task is to distinguish between inputs satisfying some predetermined property and those that are far from satisfying…
math.CO2019
On the query complexity of estimating the distance to hereditary graph properties
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang +2
Given a family of graphs , we prove that the normalized edit distance of any given graph to being induced -free is estimable with a query complexity t…