Lior Gishboliner

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 45

Top Topics

Connected Subgraphs

Linear Inequalities

Top Venues

J. Comb. Theory, Ser. B

Electron. Colloquium Comput. Complex.

Publications

Lior Gishboliner, Zhihan Jin, Benny Sudakov
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs. Comb. 44 (3) (2024)
Lior Gishboliner, Zhihan Jin, Benny Sudakov
The minimum degree removal lemma thresholds. J. Comb. Theory B 166 (2024)
Maria Axenovich, Domagoj Bradac, Lior Gishboliner, Dhruv Mubayi, Lea Weber
Large cliques or cocliques in hypergraphs with forbidden order-size pairs. Comb. Probab. Comput. 33 (3) (2024)
Domagoj Bradac, Lior Gishboliner, Benny Sudakov
On Ramsey Size-Linear Graphs and Related Questions. SIAM J. Discret. Math. 38 (1) (2024)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
Trimming forests is hard (unless they are made of stars). CoRR (2023)
Domagoj Bradac, Lior Gishboliner, Oliver Janzer, Benny Sudakov
Asymptotics of the Hypergraph Bipartite Turán Problem. Comb. 43 (3) (2023)
Lior Gishboliner, Benny Sudakov
Maximal chordal subgraphs. Comb. Probab. Comput. 32 (5) (2023)
David Conlon, Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
A new bound for the Brown-Erdős-Sós problem. J. Comb. Theory, Ser. B 158 (Part) (2023)
Lior Gishboliner, Nick Kushnir, Asaf Shapira
Testing versus estimation of graph properties, revisited. CoRR (2023)
Lior Gishboliner, Nick Kushnir, Asaf Shapira
Testing Versus Estimation of Graph Properties, Revisited. APPROX/RANDOM (2023)
Lior Gishboliner, Asaf Shapira
On Rödl's Theorem for Cographs. Electron. J. Comb. 30 (4) (2023)
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
Oriented discrepancy of Hamilton cycles. J. Graph Theory 103 (4) (2023)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
Counting Homomorphic Cycles in Degenerate Graphs. ACM Trans. Algorithms 19 (1) (2023)
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
Color-biased Hamilton cycles in random graphs. Random Struct. Algorithms 60 (3) (2022)
Lior Gishboliner
A characterization of easily testable induced digraphs and k-colored graphs. Eur. J. Comb. 103 (2022)
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
Discrepancies of spanning trees and Hamilton cycles. J. Comb. Theory, Ser. B 154 (2022)
Lior Gishboliner, Raphael Steiner, Tibor Szabó
Oriented Cycles in Digraphs of Large Outdegree. Comb. 42 (6) (2022)
Lior Gishboliner, Raphael Steiner, Tibor Szabó
Dichromatic number and forced subdivisions. J. Comb. Theory, Ser. B 153 (2022)
Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira
Counting Subgraphs in Degenerate Graphs. J. ACM 69 (3) (2022)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
Counting Homomorphic Cycles in Degenerate Graphs. SODA (2022)
Lior Gishboliner, Asaf Shapira, Henrique Stagni
Testing linear inequalities of subgraph statistics. Random Struct. Algorithms 58 (3) (2021)
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Random Struct. Algorithms 57 (4) (2020)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
Counting Homomorphic Cycles in Degenerate Graphs. CoRR (2020)
Lior Gishboliner, Asaf Shapira, Henrique Stagni
Testing linear inequalities of subgraph statistics. Electron. Colloquium Comput. Complex. 27 (2020)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
Counting Subgraphs in Degenerate Graphs. CoRR (2020)
Lior Gishboliner, Asaf Shapira, Henrique Stagni
Testing linear inequalities of subgraph statistics. CoRR (2020)
Lior Gishboliner, Asaf Shapira, Henrique Stagni
Testing Linear Inequalities of Subgraph Statistics. ITCS (2020)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
Counting Subgraphs in Degenerate Graphs. Electron. Colloquium Comput. Complex. 27 (2020)
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. SODA (2020)
Lior Gishboliner
Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties. CoRR (2020)
Lior Gishboliner, Asaf Shapira
Efficient Removal Without Efficient Regularity. Comb. 39 (3) (2019)
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. CoRR (2019)
Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster
The removal lemma for tournaments. J. Comb. Theory, Ser. B 136 (2019)
Lior Gishboliner, Asaf Shapira
Testing graphs against an unknown distribution. STOC (2019)
Malgorzata Bednarska-Bzdega, Omri Ben-Eliezer, Lior Gishboliner, Tuan Tran
On the separation conjecture in Avoider-Enforcer games. J. Comb. Theory, Ser. B 138 (2019)
Lior Gishboliner, Asaf Shapira
Testing Graphs against an Unknown Distribution. CoRR (2019)
Lior Gishboliner, Asaf Shapira
Testing Graphs against an Unknown Distribution. Electron. Colloquium Comput. Complex. 26 (2019)
Lior Gishboliner, Asaf Shapira
A generalized Turán problem and its applications. STOC (2018)
Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Random Struct. Algorithms 52 (4) (2018)
Noga Alon, Igor Balla, Lior Gishboliner, Adva Mond, Frank Mousset
The Minrank of Random Graphs over Arbitrary Fields. CoRR (2018)
Lior Gishboliner, Asaf Shapira
A Generalized Turan Problem and its Applications. Electron. Colloquium Comput. Complex. 25 (2018)
Lior Gishboliner, Asaf Shapira
Efficient Testing without Efficient Regularity. ITCS (2018)
Lior Gishboliner, Asaf Shapira
Removal lemmas with polynomial bounds. STOC (2017)
Lior Gishboliner, Asaf Shapira
A Generalized Turán Problem and its Applications. CoRR (2017)
Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. CoRR (2016)
Lior Gishboliner, Asaf Shapira
Deterministic vs Non-deterministic Graph Property Testing. Electron. Colloquium Comput. Complex. 20 (2013)