Lior Gishboliner

Zhihan Jin

Comb., June, 2024

On Ramsey Size-Linear Graphs and Related Questions.

[BibT_eX]

[DOI]

Domagoj Bradac

SIAM J. Discret. Math., March, 2024

The minimum degree removal lemma thresholds.

[BibT_eX]

[DOI]

Zhihan Jin

J. Comb. Theory B, 2024

Large cliques or cocliques in hypergraphs with forbidden order-size pairs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2024

Polynomial Removal Lemma for Ordered Matchings.

[BibT_eX]

[DOI]

Borna Simic

Electron. J. Comb., 2024

Minimum Degree Threshold for $H$-factors with High Discrepancy.

[BibT_eX]

[DOI]

Domagoj Bradac

Micha Christoph

Electron. J. Comb., 2024

2023

Maximal chordal subgraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., September, 2023

Oriented discrepancy of Hamilton cycles.

[BibT_eX]

[DOI]

Peleg Michaeli

J. Graph Theory, August, 2023

Asymptotics of the Hypergraph Bipartite Turán Problem.

[BibT_eX]

[DOI]

Comb., June, 2023

Counting Homomorphic Cycles in Degenerate Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, January, 2023

A new bound for the Brown-Erdős-Sós problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

Trimming forests is hard (unless they are made of stars).

[BibT_eX]

[DOI]

Yevgeny Levanzov

CoRR, 2023

On Rödl's Theorem for Cographs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Testing Versus Estimation of Graph Properties, Revisited.

[BibT_eX]

[DOI]

Nick Kushnir

Proceedings of the Approximation, 2023

2022

Oriented Cycles in Digraphs of Large Outdegree.

[BibT_eX]

[DOI]

Raphael Steiner

Tibor Szabó

Comb., December, 2022

Color-biased Hamilton cycles in random graphs.

[BibT_eX]

[DOI]

Peleg Michaeli

Random Struct. Algorithms, 2022

Dichromatic number and forced subdivisions.

[BibT_eX]

[DOI]

Raphael Steiner

Tibor Szabó

J. Comb. Theory B, 2022

Discrepancies of spanning trees and Hamilton cycles.

[BibT_eX]

[DOI]

Peleg Michaeli

J. Comb. Theory B, 2022

Counting Subgraphs in Degenerate Graphs.

[BibT_eX]

[DOI]

J. ACM, 2022

A characterization of easily testable induced digraphs and k-colored graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Polynomial removal lemmas for ordered graphs.

[BibT_eX]

[DOI]

István Tomon

Comb. Theory, 2022

2020

Very fast construction of bounded-degree spanning graphs via the semi-random graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Testing linear inequalities of subgraph statistics.

[BibT_eX]

[DOI]

Henrique Stagni

Electron. Colloquium Comput. Complex., 2020

Counting Subgraphs in Degenerate Graphs.

[BibT_eX]

[DOI]

Yevgeny Levanzov

Electron. Colloquium Comput. Complex., 2020

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

[BibT_eX]

[DOI]

Malgorzata Bednarska-Bzdega

CoRR, 2020

2019

The removal lemma for tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

On the separation conjecture in Avoider-Enforcer games.

[BibT_eX]

[DOI]

Omri Ben-Eliezer

Tuan Tran

J. Comb. Theory B, 2019

Testing Graphs against an Unknown Distribution.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Efficient Removal Without Efficient Regularity.

[BibT_eX]

[DOI]

Comb., 2019

2018

On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments.

[BibT_eX]

[DOI]

Gal Kronenberg

Random Struct. Algorithms, 2018

A Generalized Turan Problem and its Applications.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

The Minrank of Random Graphs over Arbitrary Fields.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient Testing without Efficient Regularity.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Removal lemmas with polynomial bounds.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2013

Deterministic vs Non-deterministic Graph Property Testing.

[BibT_eX]

[DOI]