The Turán number of sparse spanning graphs Raphael Yuster joint work with Noga Alon Banff 2012.

Slides:



Advertisements
Similar presentations
6.896: Topics in Algorithmic Game Theory Lecture 21 Yang Cai.
Advertisements

Long cycles, short cycles, min-degree subgraphs, and feedback arc sets in Eulerian digraphs Raphael Yuster joint work with Asaf Shapira Eilat 2012.
Covers, Dominations, Independent Sets and Matchings AmirHossein Bayegan Amirkabir University of Technology.
1 Decomposing Hypergraphs with Hypertrees Raphael Yuster University of Haifa - Oranim.
On the Density of a Graph and its Blowup Raphael Yuster Joint work with Asaf Shapira.
Bipartite Matching, Extremal Problems, Matrix Tree Theorem.
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Totally Unimodular Matrices
Approximation, Chance and Networks Lecture Notes BISS 2005, Bertinoro March Alessandro Panconesi University La Sapienza of Rome.
Introduction to Graph Theory Lecture 11: Eulerian and Hamiltonian Graphs.
Some Graph Problems. LINIAL’S CONJECTURE Backgound: In a partially ordered set we have Dilworth’s Theorem; The largest size of an independent set (completely.
Tutorial 6 of CSCI2110 Bipartite Matching Tutor: Zhou Hong ( 周宏 )
From Topological Methods to Combinatorial Proofs of Kneser Graphs Daphne Der-Fen Liu 劉 德 芬 Department of Mathematics California State University, Los Angeles.
The Probabilistic Method Shmuel Wimer Engineering Faculty Bar-Ilan University.
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
Mycielski’s Construction Mycielski’s Construction: From a simple graph G, Mycielski’s Construction produces a simple graph G’ containing G. Beginning with.
Matchings Matching: A matching in a graph G is a set of non-loop edges with no shared endpoints.
Definition Hamiltonian graph: A graph with a spanning cycle (also called a Hamiltonian cycle). Hamiltonian graph Hamiltonian cycle.
A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.
1 Packing directed cycles efficiently Zeev Nutov Raphael Yuster.
Graph Colouring Lecture 20: Nov 25.
1 On the Benefits of Adaptivity in Property Testing of Dense Graphs Joint work with Mira Gonen Dana Ron Tel-Aviv University.
1 Algorithmic Aspects in Property Testing of Dense Graphs Oded Goldreich – Weizmann Institute Dana Ron - Tel-Aviv University.
1 On the Benefits of Adaptivity in Property Testing of Dense Graphs Joint works with Mira Gonen and Oded Goldreich Dana Ron Tel-Aviv University.
Antimagic Labellings of Graphs Torsten Mütze Joint work with Dan Hefetz and Justus Schwartz.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Introduction to Graph Theory
Fractional decompositions of dense hypergraphs Raphael Yuster University of Haifa.
Turan’s theorem and extremal graphs Question: How many edges a simple graph must have to guarantee that the graph contains a triangle? Since K m,m and.
The Quasi-Randomness of Hypergraph Cut Properties Asaf Shapira & Raphael Yuster.
The Effect of Induced Subgraphs on Quasi-randomness Asaf Shapira & Raphael Yuster.
10.4 How to Find a Perfect Matching We have a condition for the existence of a perfect matching in a graph that is necessary and sufficient. Does this.
Approximating the Minimum Degree Spanning Tree to within One from the Optimal Degree R 陳建霖 R 宋彥朋 B 楊鈞羽 R 郭慶徵 R
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
Fan-planar Graphs: Combinatorial Properties and Complexity results Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani,
Distance sensitivity oracles in weighted directed graphs Raphael Yuster University of Haifa Joint work with Oren Weimann Weizmann inst.
Section 2.1 “Matching in bipartite graphs” in Graph Theory Handout for reading seminar.
Mycielski’s Construction Mycielski’s Construction: From a simple graph G, Mycielski’s Construction produces a simple graph G’ containing G. Beginning with.
1 The number of orientations having no fixed tournament Noga Alon Raphael Yuster.
1 Rainbow Decompositions Raphael Yuster University of Haifa Proc. Amer. Math. Soc. (2008), to appear.
Testing the independence number of hypergraphs
1 Asymptotically optimal K k -packings of dense graphs via fractional K k -decompositions Raphael Yuster University of Haifa.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
3.2 Matchings and Factors: Algorithms and Applications This copyrighted material is taken from Introduction to Graph Theory, 2 nd Ed., by Doug West; and.
Connectivity and Paths 報告人:林清池. Connectivity A separating set of a graph G is a set such that G-S has more than one component. The connectivity of G,
1 Decomposition into bipartite graphs with minimum degree 1. Raphael Yuster.
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
EMIS 8373: Integer Programming Combinatorial Relaxations and Duals Updated 8 February 2005.
Planar Graphs Lecture 10: Oct 21. This Lecture Today we will talk about planar graphs, and how to color a map using 6 colors. Planar graphs Euler’s formula.
1 Quasi-randomness is determined by the distribution of copies of a graph in equicardinal large sets Raphael Yuster University of Haifa.
Dense graphs with a large triangle cover have a large triangle packing Raphael Yuster SIAM DM’10.
Introduction to Graph Theory Lecture 13: Graph Coloring: Edge Coloring.
Introduction to Graph Theory
1 Covering Non-uniform Hypergraphs Endre Boros Yair Caro Zoltán Füredi Raphael Yuster.
Dominating set: A vertex subset S of a graph G is a dominating set
1 Complexities of some interesting problems on spanning trees M Sohel Rahman King’s College, London M Kaykobad KHU, NSU and BUET.
Introduction to Graph Theory
Interval Graph Test Wen-Lian Hsu.
Approximation Algorithms by bounding the OPT Instructor Neelima Gupta
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
Proof of correctness of Dijkstra’s algorithm: Basically, we need to prove two claims. (1)Let S be the set of vertices for which the shortest path from.
Hongyu Liang Institute for Theoretical Computer Science Tsinghua University, Beijing, China The Algorithmic Complexity.
1 Graphs Chapters 10.1 and 10.2 University of Maryland Chapters 10.1 and 10.2 Based on slides by Y. Peng University of Maryland.
CHAPTER SIX T HE P ROBABILISTIC M ETHOD M1 Zhang Cong 2011/Nov/28.
Proof Techniques and Chessboard Problems
Graphs Chapters 10.1 and 10.2 Based on slides by Y. Peng University of Maryland.
CS 583 Analysis of Algorithms
Problem Solving 4.
Locality In Distributed Graph Algorithms
Integer and fractional packing of graph families
Presentation transcript:

The Turán number of sparse spanning graphs Raphael Yuster joint work with Noga Alon Banff 2012

2 t

3

4

5

6 A counter-example to the conjecture of [GPW – 2012], already for 3 -graphs:

7

8 We need the following independent sets of G, one for each v i : S 1 consists of non-neighbors of v 1 that have small degree (less than 2n 1/2 ) S i consists of non-neighbors of v i that have very small degree (at most 50 ) Each S i is chosen with maximum cardinality, under this restriction. It is not difficult to show that | S 1 | ≥ δ and |S i | ≥ n/7. vivi N(vi)N(vi) SiSi Random subsets of S i have whp some useful properties for our embedding: Let B i be a random subset of S i where each vertex is chosen with prob. n -1/2 Lemma 1:  Whp, all the C i are relatively small (less than 4n 1/2 )  the first few D i are relatively large (at least 0.05n 1/2 for i=2,…,n 1/2 )

9 Proof outline The construction of the bijection f : V  W is done in four stages. At each point of the construction, some vertices of V are matched to some vertices of W while the other vertices of V and W are yet unmatched. Initially, all vertices are unmatched. We always maintain the packing property: for two matched vertices u,v  V with (u,v)  E we have (f(u), f(v))  F. Thus, once all vertices are matched, f defines a packing of G and H.

10 Stage 1. We match v 1 (a vertex with maximum degree in G ) with a vertex w  W having minimum degree δ in H. As N(w)= δ and since |S 1 | ≥ δ, we may match an arbitrary subset B 1 of δ vertices of S 1 with N(w). Observe that the packing property is maintained since B 1 is an independent set of non-neighbors of v 1. Note that after stage 1, precisely δ+1 pairs are matched. v1v1 N(v1)N(v1) |S 1 | ≥ δ w |N(w)|=δ S1S1 N(w)N(w) G H Other vertices

11

12 vivi Observe: it is really yet unmatched matched v j j < i Other matched neighbors unmatched neighbors X Y Z S i  Non-neighbors BiBi |X|<i<k<n 1/2 Y   j<i B j Y  N(v i ), Y  C i |Y|<5n 1/2 Lemma 1 T The matches of X  Y in H |T|=|X|+|Y| <6n 1/2 Q non-neighbors of T Is there an unmatched vertex in Q? w Unmatched neighbors of w R D i =B i -  j<i B j |D i | ≥ n 1/2 /20, lemma 1 G H

Stage I1I. We are guaranteed that the unmatched vertices of G have degree ≤ 2n 1/2. By the third invariant of Stage 2, the number of unmatched vertices of G is still linear in n (at least 19n/20 ). As the unmatched vertices induce a subgraph with at least 19n/20 vertices and less than n edges, they contain an independent set of size at least n/4. Let, therefore, J denote a maximum independent set of unmatched vertices of G. We have |J| ≥ n/4. Let K be the remaining unmatched vertices of G. The third stage consists of matching the vertices of K one by one. Details similar to those of Stage 2. 13

Stage IV. It remains to match the vertices of J to the remaining unmatched vertices of H, denoting the latter by Q. Construct a bipartite graph P whose sides are J and Q. Recall that |J|=|Q| ≥ n/4. We place an edge from v  J to q  Q if matching v to q is allowed. By this we mean that mapping v to q will not violate the packing property. At the beginning of Stage 4, for each v  J, there are at least 19n/20 vertices of H that are non-neighbors of all vertices that are matches of matched neighbors of v. So, the degree of v in P is at least 19n/20-(n-|J|) > |J|/2. It is not difficult to also show that the degree of each q  Q is much larger than |J|/2. It follows by Hall's Theorem that P has a perfect matching, completing the matching f. 14

Concluding remarks 15

Concluding remarks all our counter-examples to the [GPW – 2012] conjecture regarding the extremal numbers ex(n,H) for hypergraphs H are based on a local obstruction. It seems interesting to decide if these are all the possible examples: Problem: Is it true that for any k ≥ 2 and any Δ > 0 there is an f = f(Δ) so that for any k -graph H on n vertices and with maximum degree at most Δ, any k -graph on n vertices which contains no copy of H and with ex(n,H) edges, must contain a complete k -graph on at least n-f vertices? Problem: Is it true that for any k ≥ 2 and any Δ > 0 there is an f = f(Δ) so that for any k -graph H on n vertices and with maximum degree at most Δ, any k -graph on n vertices which contains no copy of H and with ex(n,H) edges, must contain a complete k -graph on at least n-f vertices? 16

Thanks 17