35 research outputs found
Clique Factors: Extremal and Probabilistic Perspectives
A K_r-factor in a graph G is a collection of vertex-disjoint copies of K_r covering the vertex set of G. In this thesis, we investigate these fundamental objects in three settings that lie at the intersection of extremal and probabilistic combinatorics.
Firstly, we explore pseudorandom graphs. An n-vertex graph is said to be (p,β)-bijumbled if for any vertex sets A, B ⊆ V (G), we have e( A, B) = p| A||B| ± β√|A||B|. We prove that for any 3 ≤ r ∈ N and c > 0 there exists an ε > 0 such that any n-vertex (p, β)-bijumbled graph with n ∈ rN, δ(G) ≥ c p n and β ≤ ε p^{r −1} n, contains a K_r -factor. This implies a corresponding result for the stronger pseudorandom notion of (n, d, λ)-graphs. For the case of K_3-factors, this result resolves a conjecture of Krivelevich, Sudakov and Szabó from 2004 and it is tight due to a pseudorandom triangle-free construction of Alon. In fact, in this case even more is true: as a corollary to this result, we can conclude that the same condition of β = o( p^2n) actually guarantees that a (p, β)-bijumbled graph G contains every graph on n vertices with maximum degree at most 2.
Secondly, we explore the notion of robustness for K_3-factors. For a graph G and p ∈ [0, 1], we denote by G_p the random sparsification of G obtained by keeping each edge of G independently, with probability p. We show that there exists a C > 0 such that if p ≥ C (log n)^{1/3}n^{−2/3} and G is an n-vertex graph with n ∈ 3N and δ(G) ≥ 2n/3 , then with high probability G_p contains a K_3-factor. Both the minimum degree condition and the probability condition, up to the choice of C, are tight. Our result can be viewed as a common strengthening of the classical extremal theorem of Corrádi and Hajnal, corresponding to p = 1 in our result, and the famous probabilistic theorem of Johansson, Kahn and Vu establishing the threshold for the appearance of K_3-factors (and indeed all K_r -factors) in G (n, p), corresponding to G = K_n in our result. It also implies a first lower bound on the number of K_3-factors in graphs with minimum degree at least 2n/3, which gets close to the truth.
Lastly, we consider the setting of randomly perturbed graphs; a model introduced by Bohman, Frieze and Martin, where one starts with a dense graph and then adds random edges to it. Specifically, given any fixed 0 < α < 1 − 1/r we determine how many random edges one must add to an n-vertex graph G with δ(G) ≥ α n to ensure that, with high probability, the resulting graph contains a K_r -factor. As one increases α we demonstrate that the number of random edges
required ‘jumps’ at regular intervals, and within these intervals our result is best-possible. This work therefore bridges the gap between the seminal work of Johansson, Kahn and Vu mentioned above, which resolves the purely random case, i.e., α = 0, and that of Hajnal and Szemerédi (and Corrádi and Hajnal for r = 3) showing that when α ≥ 1 − 1/r the initial graph already hosts the
desired K_r -factor.Ein K_r -Faktor in einem Graphen G ist eine Sammlung von Knoten-disjunkten Kopien von K_r , die die Knotenmenge von G überdecken. Wir untersuchen diese Objekte in drei Kontexten, die an der Schnittstelle zwischen extremaler und probabilistischer Kombinatorik liegen.
Zuerst untersuchen wir Pseudozufallsgraphen. Ein Graph heißt (p,β)-bijumbled, wenn für beliebige Knotenmengen A, B ⊆ V (G) gilt e( A, B) = p| A||B| ± β√|A||B|. Wir beweisen, dass es für jedes 3 ≤ r ∈ N und c > 0 ein ε > 0 gibt, so dass jeder n-Knoten (p, β)-bijumbled Graph mit n ∈ rN, δ(G) ≥ c p n und β ≤ ε p^{r −1} n, einen K_r -Faktor enthält. Dies impliziert ein entsprechendes Ergebnis für den stärkeren Pseudozufallsbegriff von (n, d, λ)-Graphen. Im Fall von K_3-Faktoren, löst dieses Ergebnis eine Vermutung von Krivelevich, Sudakov und Szabó aus
dem Jahr 2004 und ist durch eine pseudozufällige K_3-freie Konstruktion von Alon bestmöglich. Tatsächlich ist in diesem Fall noch mehr wahr: als Korollar dieses Ergebnisses können wir schließen, dass die gleiche Bedingung von β = o( p^2n) garantiert, dass ein (p, β)-bijumbled Graph G jeden Graphen mit maximalem Grad 2 enthält.
Zweitens untersuchen wir den Begriff der Robustheit für K_3-Faktoren. Für einen Graphen G und p ∈ [0, 1] bezeichnen wir mit G_p die zufällige Sparsifizierung von G, die man erhält, indem man jede Kante von G unabhängig von den anderen Kanten mit einer Wahrscheinlichkeit p behält. Wir zeigen, dass, wenn p ≥ C (log n)^{1/3}n^{−2/3} und G ein n-Knoten-Graph mit n ∈ 3N und δ(G) ≥ 2n/3 ist, G_pmit hoher Wahrscheinlichkeit (mhW) einen K_3-Faktor enthält. Sowohl die Bedingung des minimalen Grades als auch die Wahrscheinlichkeitsbedingung sind bestmöglich. Unser Ergebnis ist eine Verstärkung des klassischen extremalen Satzes von Corrádi und Hajnal, entsprechend p = 1 in unserem Ergebnis, und des berühmten probabilistischen Satzes von Johansson, Kahn und Vu, der den Schwellenwert für das Auftreten eines K_3-Faktors (und aller K_r -Faktoren) in G (n, p) festlegt, entsprechend G = K_n in unserem Ergebnis. Es impliziert auch eine erste untere Schranke für die Anzahl der K_3-Faktoren in Graphen mit einem minimalen Grad von mindestens 2n/3, die der Wahrheit nahe kommt.
Schließlich betrachten wir die Situation von zufällig gestörten Graphen; ein Modell, bei dem man mit einem dichten Graphen beginnt und dann zufällige Kanten hinzufügt. Wir bestimmen, bei gegebenem 0 < α < 1 − 1/r, wie viele zufällige Kanten man zu einem n-Knoten-Graphen G mit δ(G) ≥ α n hinzufügen muss, um sicherzustellen, dass der resultierende Graph mhW einen K_r -Faktor enthält. Wir zeigen, dass, wenn man α erhöht, die Anzahl der benötigten Zufallskanten in regelmäßigen Abständen “springt", und innerhalb dieser Abstände unser Ergebnis bestmöglich ist. Diese Arbeit schließt somit die Lücke zwischen der oben erwähnten bahnbrechenden Arbeit von Johansson, Kahn und Vu, die den rein zufälligen Fall, d.h. α = 0, löst, und der Arbeit von Hajnal und Szemerédi (und Corrádi und Hajnal für r = 3), die zeigt, dass der ursprüngliche Graph bereits den gewünschten K_r -Faktor enthält, wenn α ≥ 1 − 1/r ist
FLEET: Butterfly Estimation from a Bipartite Graph Stream
We consider space-efficient single-pass estimation of the number of
butterflies, a fundamental bipartite graph motif, from a massive bipartite
graph stream where each edge represents a connection between entities in two
different partitions. We present a space lower bound for any streaming
algorithm that can estimate the number of butterflies accurately, as well as
FLEET, a suite of algorithms for accurately estimating the number of
butterflies in the graph stream. Estimates returned by the algorithms come with
provable guarantees on the approximation error, and experiments show good
tradeoffs between the space used and the accuracy of approximation. We also
present space-efficient algorithms for estimating the number of butterflies
within a sliding window of the most recent elements in the stream. While there
is a significant body of work on counting subgraphs such as triangles in a
unipartite graph stream, our work seems to be one of the few to tackle the case
of bipartite graph streams.Comment: This is the author's version of the work. It is posted here by
permission of ACM for your personal use. Not for redistribution. The
definitive version was published in Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet
Erdem Sariyuce and Srikanta Tirthapura. "FLEET: Butterfly Estimation from a
Bipartite Graph Stream". The 28th ACM International Conference on Information
and Knowledge Managemen
Products of Differences over Arbitrary Finite Fields
There exists an absolute constant such that for all and all
subsets of the finite field with elements, if
, then Any suffices for sufficiently large
. This improves the condition , due to Bennett, Hart,
Iosevich, Pakianathan, and Rudnev, that is typical for such questions.
Our proof is based on a qualitatively optimal characterisation of sets for which the number of solutions to the equation is nearly
maximum.
A key ingredient is determining exact algebraic structure of sets for
which is nearly minimum, which refines a result of Bourgain and
Glibichuk using work of Gill, Helfgott, and Tao.
We also prove a stronger statement for when are sets in a prime field,
generalising a result of Roche-Newton, Rudnev, Shkredov, and the authors.Comment: 42 page
Large structures in dense directed graphs
We answer questions in extremal combinatorics, for directed graphs. Specifically, we investigate which large tree-like directed graphs are contained in all dense directed graphs of large order. More precisely, let T be an oriented tree of order n; among others, we establish the following results.
(1) We obtain a sufficient condition which ensures every tournament of order n contains T, and show that almost every tree possesses this property.
(2) We prove that for all positive C, ɛ and sufficiently large n, every tournament of order (1+ɛ)n contains T if Δ(T)≤(log n)^C.
(3) We prove that for all positive Δ, ɛ and sufficiently large n, every directed graph G of order n and minimum semidegree (1/2+ɛ)n contains T if Δ(T)≤Δ.
(4) We obtain a sufficient condition which ensures that every directed graph G of order n with minimum semidegree at least (1/2+É›)n contains T, and show that almost every tree possesses this property.
(5) We extend our method in (4) to a class of tree-like spanning graphs which includes all orientations of Hamilton cycles and large subdivisions of any graph.
Result (1) confirms a conjecture of Bender and Wormald and settles a conjecture of Havet and Thomassé for almost every tree; (2) strengthens a result of Kühn, Mycroft and Osthus; (3) is a directed graph analogue of a classical result of Komlós, Sárközy and Szemerédi and is implied by (4) and (5) is of independent interest
Discrete Geometry and Convexity in Honour of Imre Bárány
This special volume is contributed by the speakers of the Discrete Geometry and
Convexity conference, held in Budapest, June 19–23, 2017. The aim of the conference
is to celebrate the 70th birthday and the scientific achievements of professor
Imre Bárány, a pioneering researcher of discrete and convex geometry, topological
methods, and combinatorics. The extended abstracts presented here are written by
prominent mathematicians whose work has special connections to that of professor
Bárány. Topics that are covered include: discrete and combinatorial geometry,
convex geometry and general convexity, topological and combinatorial methods.
The research papers are presented here in two sections. After this preface and a
short overview of Imre Bárány’s works, the main part consists of 20 short but very
high level surveys and/or original results (at least an extended abstract of them)
by the invited speakers. Then in the second part there are 13 short summaries of
further contributed talks.
We would like to dedicate this volume to Imre, our great teacher, inspiring
colleague, and warm-hearted friend