Lior Gishboliner

From MaRDI portal
Person:480809

Available identifiers

zbMath Open gishboliner.liorMaRDI QIDQ480809

List of research outcomes





PublicationDate of PublicationType
Testing versus estimation of graph properties, revisited2025-01-14Paper
Trimming forests is hard (unless they are made of stars)2024-12-18Paper
Polynomial removal lemma for ordered matchings2024-11-09Paper
Maximal chordal subgraphs2024-11-05Paper
Large cliques or cocliques in hypergraphs with forbidden order-size pairs2024-11-05Paper
Testing versus estimation of graph properties, revisited2024-10-24Paper
Minimum degree threshold for \(H\)-factors with high discrepancy2024-10-07Paper
Counting homomorphic cycles in degenerate graphs2024-07-19Paper
The minimum degree removal lemma thresholds2024-03-14Paper
On Rödl's theorem for cographs2024-02-16Paper
On Ramsey Size-Linear Graphs and Related Questions2024-01-23Paper
Tight Hamilton cycles with high discrepancy2023-12-15Paper
Difference-Isomorphic Graph Families2023-12-11Paper
Counting Homomorphic Cycles in Degenerate Graphs2023-10-23Paper
Trimming forests is hard (unless they are made of stars)2023-10-17Paper
Color‐biased Hamilton cycles in random graphs2023-10-12Paper
Testing linear inequalities of subgraph statistics2023-10-11Paper
Oriented discrepancy of Hamilton cycles2023-10-10Paper
Asymptotics of the hypergraph bipartite Turán problem2023-10-04Paper
On 3‐graphs with no four vertices spanning exactly two edges2023-09-20Paper
Ramsey problems for monotone paths in graphs and hypergraphs2023-08-08Paper
Polynomial removal lemma for ordered matchings2023-07-04Paper
Testing versus estimation of graph properties, revisited2023-05-09Paper
Large cliques or co-cliques in hypergraphs with forbidden order-size pairs2023-05-02Paper
Counting Subgraphs in Degenerate Graphs2023-04-27Paper
Minimum Degree Threshold for $H$-factors with High Discrepancy2023-02-27Paper
https://portal.mardi4nfdi.de/entity/Q58757432023-02-03Paper
An efficient asymmetric removal lemma and its limitations2023-01-18Paper
A new bound for the Brown-Erdős-Sós problem2022-11-28Paper
Polynomial removal lemmas for ordered graphs2022-11-23Paper
Cycles of many lengths in Hamiltonian graphs2022-09-06Paper
Maximal Chordal Subgraphs2022-05-17Paper
A characterization of easily testable induced digraphs and \(k\)-colored graphs2022-05-10Paper
Testing graphs against an unknown distribution2022-04-25Paper
Discrepancies of spanning trees and Hamilton cycles2022-03-03Paper
Hypergraph removal with polynomial bounds2022-02-15Paper
Removal lemmas with polynomial bounds2022-01-13Paper
A Generalized Turán Problem and its Applications2021-12-09Paper
Constructing dense grid-free linear $3$-graphs2021-11-09Paper
Efficient Testing without Efficient Regularity2021-06-15Paper
Small doubling, atomic structure and $\ell$-divisible set families2021-03-30Paper
Very fast construction of bounded-degree spanning graphs via the semi-random graph process2021-02-02Paper
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process2021-01-05Paper
Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties2020-09-26Paper
Oriented cycles in digraphs of large outdegree2020-08-30Paper
Testing linear inequalities of subgraph statistics2020-07-20Paper
The minrank of random graphs over arbitrary fields2020-03-04Paper
Testing graphs against an unknown distribution2020-01-30Paper
Efficient removal without efficient regularity2019-09-04Paper
A generalized Turán problem and its applications2019-08-22Paper
The removal lemma for tournaments2019-06-17Paper
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments2018-09-05Paper
Removal lemmas with polynomial bounds2017-08-17Paper
Deterministic vs non-deterministic graph property testing2014-12-11Paper

Research outcomes over time

This page was built for person: Lior Gishboliner