4 citations · 9 across the 32 of their papers we have counts for
56 papers · 1 filter
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
We prove that for every acyclic matrix pattern it holds that .
NP-Hardness of the -Free Edge-Deletion Problem
Lior Gishboliner, Ethan Honest
For a graph , the -freeness edge-deletion problem is the algorithmic problem of finding, for an input graph , the minimum number of edges of whose deletion turns i…
Homomorphism and VC-dimension thresholds: spectra and separations
Lior Gishboliner, Xinqi Huang, Hong Liu
Minimum-degree thresholds ask when excluding a fixed graph forces a dense graph to admit a simple global description. For each fixed chromatic number, the chromatic threshold h…
A Simple Counting Argument for Dense Linear Hypergraphs
Lior Gishboliner, József Solymosi
In connection to the Brown-Erdős-Sós conjecture, we give a short local averaging proof of a density theorem for linear uniform hypergraphs. Let , , and suppose th…
Multicolor -Tilings with High Discrepancy
Henry Chan, Daniel Cheng, Lior Gishboliner +1
We study the minimum degree threshold guaranteeing the existence of -tilings of high discrepancy in any -edge-coloring. Balogh, Csaba, Pluhár and Treglown handled…
Subgraph discrepancies in the complete graph
Micha Christoph, Lior Gishboliner, Michael Krivelevich
Given a 2-edge-coloring , the discrepancy of a subgraph is defined as . Erdős, Füredi, Lo…