17 papers
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…
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 handl…
Defect and transference versions of the Alon-Frankl-Lovasz theorem
Lior Gishboliner, Stefan Glock, Peleg Michaeli +1
Confirming a conjecture of ErdÅs on the chromatic number of Kneser hypergraphs, Alon, Frankl and Lovász proved that in any -colouring of the edges of the complete -uniform…
Is it easy to regularize a hypergraph with easy links?
Lior Gishboliner, Asaf Shapira, Yuval Wigderson
A partition of a (hyper)graph is -homogenous if the edge densities between almost all clusters are either at most or at least . Suppose a…
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,…
Set mappings for general graphs
Lior Gishboliner, Zhihan Jin, Benny Sudakov
The study of extremal problems for set mappings has a long history. It was introduced in 1958 by ErdÅs and Hajnal, who considered the case of cliques in graphs and hypergraphs. Re…