Lior Gishboliner

activity

20132024

most citedDeterministic vs Non-deterministic Graph Property Testing

4 citations · 4 across the 7 of their papers we have counts for

collaborators

16 papers

math.CO2024

Induced subgraphs of $K_{r}$ -free graphs and the Erdős--Rogers problem

Lior Gishboliner, Oliver Janzer, Benny Sudakov

For two graphs $F, H$ and a positive integer $n$ , the function $f_{F, H} (n)$ denotes the largest $m$ such that every $H$ -free graph on $n$ vertices contains an $F$ -free induced subgr…

math.CO2022

Asymptotics of the hypergraph bipartite Turán problem

Domagoj Bradač, Lior Gishboliner, Oliver Janzer +1

For positive integers $s, t, r$ , let $K_{s, t}^{(r)}$ denote the $r$ -uniform hypergraph whose vertex set is the union of pairwise disjoint sets $X, Y_{1}, \dots, Y_{t}$ , where $∣ X ∣ = s$ and…

math.CO2022

A Characterization of Easily Testable Induced Digraphs and $k$ -Colored Graphs

Lior Gishboliner

We complete the characterization of the digraphs $D$ for which the induced $D$ -removal lemma has polynomial bounds, answering a question of Alon and Shapira. We also study the anal…

math.CO2021

Cycles of many lengths in Hamiltonian graphs

Matija Bucić, Lior Gishboliner, Benny Sudakov

In 1999, Jacobson and Lehel conjectured that for $k \geq 3$ , every $k$ -regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthen…

math.CO2020

Constructing Dense Grid-Free Linear $3$ -Graphs

Lior Gishboliner, Asaf Shapira

We show that there exist linear $3$ -uniform hypergraphs with $n$ vertices and $Ω (n^{2})$ edges which contain no copy of the $3 \times 3$ grid. This makes significant progress on a co…

math.CO2020

Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties

Lior Gishboliner

We show that if the degree sequence of a graph $G$ is close in $ℓ_{1}$ -distance to a given realizable degree sequence $(d_{1}, \dots, d_{n})$ , then $G$ is close in edit distance to a gr…

Induced subgraphs of Kr​-free graphs and the Erdős--Rogers problem

Asymptotics of the hypergraph bipartite Turán problem

A Characterization of Easily Testable Induced Digraphs and k-Colored Graphs

Cycles of many lengths in Hamiltonian graphs

Constructing Dense Grid-Free Linear 3-Graphs

Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties

Induced subgraphs of $K_{r}$ -free graphs and the Erdős--Rogers problem

A Characterization of Easily Testable Induced Digraphs and $k$ -Colored Graphs

Constructing Dense Grid-Free Linear $3$ -Graphs