7 citations · 19 across the 40 of their papers we have counts for
6 papers · 1 filter
Maximal Chordal Subgraphs
Lior Gishboliner, Benny Sudakov
A chordal graph is a graph with no induced cycles of length at least . Let be the maximal integer such that every graph with vertices and edges has a chordal su…
Asymptotics of the hypergraph bipartite Turán problem
Domagoj Bradač, Lior Gishboliner, Oliver Janzer +1
For positive integers , let denote the -uniform hypergraph whose vertex set is the union of pairwise disjoint sets , where and…
Oriented discrepancy of Hamilton cycles
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
We propose the following conjecture extending Dirac's theorem: if is a graph with vertices and minimum degree , then in every orientation of there is…
A Characterization of Easily Testable Induced Digraphs and -Colored Graphs
Lior Gishboliner
We complete the characterization of the digraphs for which the induced -removal lemma has polynomial bounds, answering a question of Alon and Shapira. We also study the anal…
On Ramsey size-linear graphs and related questions
Domagoj Bradač, Lior Gishboliner, Benny Sudakov
In this paper we prove several results on Ramsey numbers for a fixed graph and a large graph , in particular for . These results extend earlier work of Erd…
Hypergraph removal with polynomial bounds
Lior Gishboliner, Asaf Shapira
Given a fixed -uniform hypergraph , the -removal lemma states that every hypergraph with few copies of can be made -free by the removal of few edges. Unfortunately,…