1 citations · 2 across the 5 of their papers we have counts for
5 papers
Hardness of Hypergraph Edge Modification Problems
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
For a fixed graph , let denote the size of the largest -free subgraph of . Computing or estimating for various pairs is one of the central proble…
Trimming forests is hard (unless they are made of stars)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
Graph modification problems ask for the minimal number of vertex/edge additions/deletions needed to make a graph satisfy some predetermined property. A (meta) problem of this type,…
Counting Homomorphic Cycles in Degenerate Graphs
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira +1
Since counting subgraphs in general graphs is, by and large, a computationally demanding problem, it is natural to try and design fast algorithms for restricted families of graphs.…
Counting Subgraphs in Degenerate Graphs
Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov +2
We consider the problem of counting the number of copies of a fixed graph within an input graph . This is one of the most well-studied algorithmic graph problems, with many…
A New Bound for the Brown--Erdős--Sós Problem
David Conlon, Lior Gishboliner, Yevgeny Levanzov +1
Let denote the maximum number of edges in a -uniform hypergraph not containing edges spanned by at most vertices. One of the most influential open problems in…