Add to ORKGWe consider bipartite subgraphs of sparse random graphs that are regular in the sense of Szemerédi and, among other things, show that they must satisfy a certain local pseudorandom property. This property and its consequences turn out to be useful when considering embedding problems in subgraphs of sparse random graphs
Local algorithms on graphs are algorithms that run in par-allel on the nodes of a graph to compute s...
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular...
Abstract. We look at the minimal size of a maximal matching in general, bipartite and ¡-regular rand...
Abstract. We consider bipartite subgraphs of sparse random graphs that are regular in the sense of S...
The first half of this paper is mainly expository, and aims at introducing the regularity lemma of S...
Szemerédi’s regularity lemma is a fundamental tool in extremal combinatorics. However, the original...
The KŁR conjecture of Kohayakawa, Łuczak, and Rödl is a statement that allows one to prove that asym...
We develop a new technique that allows us to show in a unified way that many well-known combinatoria...
We state a sparse approximate version of the blow-up lemma, showing that regular partitions in suffi...
A common theme in modern combinatorics consists in proving sparse analogues of results known in the ...
In this paper we use Szemerédi’s Regularity Lemma to show that we can take A, a subset of the intege...
AbstractLet Gn,d denote the uniformly random d-regular graph on n vertices. For any S⊂[n], we obtain...
In this thesis we explore extremal graph theory, focusing on new methods which apply to different no...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.Cataloged fro...
AbstractWe present a unified approach to proving Ramsey-type theorems for graphs with a forbidden in...
Local algorithms on graphs are algorithms that run in par-allel on the nodes of a graph to compute s...
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular...
Abstract. We look at the minimal size of a maximal matching in general, bipartite and ¡-regular rand...
Abstract. We consider bipartite subgraphs of sparse random graphs that are regular in the sense of S...
The first half of this paper is mainly expository, and aims at introducing the regularity lemma of S...
Szemerédi’s regularity lemma is a fundamental tool in extremal combinatorics. However, the original...
The KŁR conjecture of Kohayakawa, Łuczak, and Rödl is a statement that allows one to prove that asym...
We develop a new technique that allows us to show in a unified way that many well-known combinatoria...
We state a sparse approximate version of the blow-up lemma, showing that regular partitions in suffi...
A common theme in modern combinatorics consists in proving sparse analogues of results known in the ...
In this paper we use Szemerédi’s Regularity Lemma to show that we can take A, a subset of the intege...
AbstractLet Gn,d denote the uniformly random d-regular graph on n vertices. For any S⊂[n], we obtain...
In this thesis we explore extremal graph theory, focusing on new methods which apply to different no...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.Cataloged fro...
AbstractWe present a unified approach to proving Ramsey-type theorems for graphs with a forbidden in...
Local algorithms on graphs are algorithms that run in par-allel on the nodes of a graph to compute s...
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular...
Abstract. We look at the minimal size of a maximal matching in general, bipartite and ¡-regular rand...