5 citations · 5 across the 3 of their papers we have counts for
4 papers
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…
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…
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…
Estimating parameters associated with monotone properties
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang +2
There has been substantial interest in estimating the value of a graph parameter, i.e., of a real-valued function defined on the set of finite graphs, by querying a randomly sample…