Elusive problems in extremal graph theory
|
|
- Roland Nelson
- 6 years ago
- Views:
Transcription
1 Elusive problems in extremal graph theory Andrzej Grzesik (Krakow) Dan Král (Warwick) László Miklós Lovász (MIT/Stanford) 2/5/27
2 Overview of talk uniqueness of extremal configurations motivation and formulation of problem graph limits representation of large graphs finitely forcible graph limits large graphs with assymptotically unique structures main result, proof tools and extensions 2
3 Turán Problems Maximum edge-density of H-free graph Mantel s Theorem (97): 2 for H = K 3 (Kn 2,n 2 ) Turán s Theorem (94): l 2 l for H = K l (K n l,..., n l ) Erdős-Stone Theorem (946): χ(h) 2 χ(h) extremal examples unique up to o(n 2 ) edges 3
4 Edge vs. Triangle Problem Minimum density of K 3 for a specific edge-density determined by Razborov (28), K αn,...,αn,( kα)n extensions by Nikiforov (2) and Reiher (26) for K l Pikhurko and Razborov (27) gave extremal examples generally not unique, can be made unique by K n = 4
5 Another example Minimum sum of densities of K 3 and K 3 Goodman s Bound (959): K 3 +K 3 4 every n/2-regular graph is a minimizer minimizer can be made unique K 3 =, or K 3 =, or C 4 = /6 (Erdős-Rényi random graph G n,/2 ) 5
6 This talk Conjecture (Lovász 28, Lovász and Szegedy 2) Every finite feasible set H i = d i, i =,...,k, can be extended to a finite feasible set with an asymptotically unique structure. Every extremal problem has a finitely forcible optimum. Theorem (Grzesik, K., Lovász Jr.): FALSE 6
7 Graph limits large networks large graphs how to represent? how to model? how to generate? concise (analytic) representation of large graphs we implicitly use limits in our considerations anyway mathematics motivation extremal graph theory What is a typical structure of an extremal graph? calculations avoiding smaller order terms in this talk: dense graphs ( E = Ω( V 2 )) Borgs, Chayes, Lovász, Sós, Szegedy, Vesztergombi,... convergence vs. analytic representation 7
8 Convergent graph sequence d(h,g) = probability H -vertex subgraph of G is H a sequence (G n ) n N of graphs is convergent if d(h,g n ) converges for every H examples: K n, K αn,n, blow ups G[K n ] Erdős-Rényi random graphs G n,p, planar graphs extendable to other discrete structures 8
9 Limit object: graphon graphon W : [,] 2 [,], s.t. W(x,y) = W(y,x) W-random graph of order n random points x i [,], edge probability W(x i,x j ) d(h,w) = prob. H -vertex W-random graph is H W is a limit of (G n ) n N if d(h,w) = lim n d(h,g n) 9
10 Limit object: graphon graphon W : [,] 2 [,], s.t. W(x,y) = W(y,x) W-random graph of order n random points x i [,], edge probability W(x i,x j ) d(h,w) = prob. H -vertex W-random graph is H W is a limit of (G n ) n N if d(h,w) = lim n d(h,g n) every convergent sequence of graphs has a limit W-random graphs converge to W with probability one
11 Applications of graph limits extremal combinatorics flag algebras of Razborov density calculations, computer search computer science property and parameter testing cover of the space of all graphons structure of typical graphs graphon entropy, number of graphs c (n 2)
12 Statement of problem Conjecture (Lovász 28, Lovász and Szegedy 2): Every finite feasible set H i = d i, i =,...,k, can be extended to a finite feasible set that is satisifed by a unique graphon. uniqueness of graphons (Borgs, Chayes, Lovász 2) W(x,y) and W ϕ (x,y) := W(ϕ(x),ϕ(y)) are the same A graphon W is finitely forcible if there exist H,...,H k and d,...,d k such that W is the only graphon with the density of H i equal to d i. 2
13 Finitely forcible graph limits Lovász, Sós (28): Step graphons are finitely forcible. extremal graph theory problem finitely forcible optimal solution simple structure gives new bounds on old problems Conjectures (Lovász and Szegedy): The space T(W) of a finitely forcible W is compact. The space T(W) has finite dimension. 3
14 Finitely forcible graphons Theorem (Glebov, K., Volec): T(W) can fail to be locally compact Theorem (Glebov, Klimošová, K.): T(W) can have a part homeomorphic to [,] Theorem (Cooper, Kaiser, K., Noel): finitely forcible W such that every ε-regular partition has at least 2 ε 2 /loglogε parts (for inf. many ε ). Theorem (Cooper, K., Martins): Every graphon is a subgraphon of a finitely forcible graphon. 4
15 Rademacher graphon 5
16 Non-regular graphon A A B C D E F G P Q R B C D E F G P Q R 6
17 Universal construction A B C D E F G P Q R A B C D E F G W F P Q R 7
18 Main result Theorem (Grzesik, K., Lovász Jr.) graphon family W, graphs H i, reals d i, i =,...,m W W d(h i,w) = d i for i =,...,m no graphon in W is finitely forcible A B C A B C D A D B D C D D D E D F D G E F G H D A D B D C D D D E D F D G E F G H 8
19 Some details of the proof graphons W P ( z), z [,] N z satisfies polynomial inequalities in P (e.g. z +z 2 2 ) z constrained to be from Z [,] N such that d(h,w P ( z)) = f (z,z 2 ) d(h 2,W P ( z)) = f 2 (z,z 2, z 3,z 4,z 5 ) d(h 3,W P ( z)) = f 3 (z,z 2, z 3,z 4,z 5, z 6,z 7,z 8,z 9 ) the set Z is non-trivial there exists a bijective map from [,] N to Z such that (x ) (z,z 2 ), (x,x 2 ) (z,z 2, z 3,z 4,z 5 ), etc. 9
20 Some details of the proof graphons W P ( z), z [,] N z satisfies polynomial inequalities in P (e.g. z +z 2 2 ) independent of P: there exist graphs H,...,H k there exist polynomials q,...,q l in d(h i,w) for every P: there exist reals α,...,α l W P ( z) are precisely graphons satisfying q i = α i analysis of the dependance of d(h i,w P ( z)) on P approximation of inverse maps by polyn. inequalities 2
21 Possible extensions techniques universal to prove more general results equalize other functions than subgraph densities Theorem (Grzesik, K., Lovász Jr.) graphon family W, graphs H i, reals d i, i =,...,m W W d(h i,w) = d i for i =,...,m no graphon in W is finitely forcible all graphons in W have the same entropy extremal problems with no typical structure 2
22 Thank you for your attention! 22
Graph limits Graph convergence Approximate asymptotic properties of large graphs Extremal combinatorics/computer science : flag algebra method, proper
Jacob Cooper Dan Král Taísa Martins University of Warwick Monash University - Discrete Maths Research Group Graph limits Graph convergence Approximate asymptotic properties of large graphs Extremal combinatorics/computer
More informationUndecidability of Linear Inequalities Between Graph Homomorphism Densities
Undecidability of Linear Inequalities Between Graph Homomorphism Densities Hamed Hatami joint work with Sergey Norin School of Computer Science McGill University December 4, 2013 Hamed Hatami (McGill University)
More informationCharacterizing extremal limits
Characterizing extremal limits Oleg Pikhurko University of Warwick ICERM, 11 February 2015 Rademacher Problem g(n, m) := min{#k 3 (G) : v(g) = n, e(g) = m} Mantel 1906, Turán 41: max{m : g(n, m) = 0} =
More informationFinitely forcible graphons and permutons
Finitely forcible graphons and permutons arxiv:1307.2444v4 [math.co] 4 Jul 2014 Roman Glebov Andrzej Grzesik Tereza Klimošová Daniel Král Abstract We investigate when limits of graphs(graphons) and permutations(permutons)
More informationThe large deviation principle for the Erdős-Rényi random graph
The large deviation principle for the Erdős-Rényi random graph (Courant Institute, NYU) joint work with S. R. S. Varadhan Main objective: how to count graphs with a given property Only consider finite
More informationFlag Algebras in Extremal Graph Theory
Jagiellonian University Faculty of Mathematics and Computer Science Theoretical Computer Science Department Andrzej Grzesik Flag Algebras in Extremal Graph Theory PhD Thesis Supervisor: Jaros law Grytczuk
More informationGraph Limits: Some Open Problems
Graph Limits: Some Open Problems 1 Introduction Here are some questions from the open problems session that was held during the AIM Workshop Graph and Hypergraph Limits, Palo Alto, August 15-19, 2011.
More informationSzemerédi s Lemma for the Analyst
Szemerédi s Lemma for the Analyst László Lovász and Balázs Szegedy Microsoft Research April 25 Microsoft Research Technical Report # MSR-TR-25-9 Abstract Szemerédi s Regularity Lemma is a fundamental tool
More informationMaximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle József Balogh Ping Hu Bernard Lidický Florian Pfender arxiv:1411.4645v1 [math.co] 17 Nov 2014 October 19, 2018 Abstract
More informationWeak regularity and finitely forcible graph limits
arxiv:507.00067v4 [math.o] 26 ug 206 Weak regularity and finitely forcible graph limits Jacob W. ooper Tomáš Kaiser aniel Král Jonathan. Noel bstract raphons are analytic objects representing limits of
More informationThe Rainbow Turán Problem for Even Cycles
The Rainbow Turán Problem for Even Cycles Shagnik Das University of California, Los Angeles Aug 20, 2012 Joint work with Choongbum Lee and Benny Sudakov Plan 1 Historical Background Turán Problems Colouring
More informationMaximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle József Balogh Ping Hu Bernard Lidický Florian Pfender September 1, 2015 Abstract Let C(n) denote the maximum number of induced
More informationEMERGENT STRUCTURES IN LARGE NETWORKS
Applied Probability Trust (29 November 2012) EMERGENT STRUCTURES IN LARGE NETWORKS DAVID ARISTOFF, University of Minnesota CHARLES RADIN, The University of Texas at Austin Abstract We consider a large
More informationAn exact Turán result for tripartite 3-graphs
An exact Turán result for tripartite 3-graphs Adam Sanitt Department of Mathematics University College London WC1E 6BT, United Kingdom adam@sanitt.com John Talbot Department of Mathematics University College
More informationInduced Turán numbers
Induced Turán numbers Michael Tait Carnegie Mellon University mtait@cmu.edu Atlanta Lecture Series XVIII Emory University October 22, 2016 Michael Tait (CMU) October 22, 2016 1 / 25 Michael Tait (CMU)
More informationRainbow triangles in 3-edge-colored graphs
Rainbow triangles in 3-edge-colored graphs József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young SIAM Conference on Discrete Mathematics Jun 17, 2014 2 Problem Find a 3-edge-coloring
More informationThe Minimum Size of 3-Graphs without a 4-Set Spanning No or Exactly Three Edges
The Minimum Size of 3-Graphs without a 4-Set Spanning No or Exactly Three Edges Oleg Pikhurko Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513 Web: http://www.math.cmu.edu/~pikhurko
More informationCompact orbit spaces in Hilbert spaces and limits of edge-colouring models
Compact orbit spaces in Hilbert spaces and limits of edge-colouring models Guus Regts 1 and Alexander Schrijver 2 Abstract. Let G be a group of orthogonal transformations of a real Hilbert space H. Let
More informationSZEMERÉDI S REGULARITY LEMMA 165
SZEMERÉDI S REGULARITY LEMMA 165 9.4 SZEMERÉDI S REGULARITY LEMMA In this section we describe a fundamental result, the Regularity Lemma, proved by Endre Szemerédi in the 70s. The original motivation for
More informationOn the 3-local profiles of graphs
On the -local profiles of graphs Hao Huang Nati Linial Humberto Naves Yuval Peled Benny Sudakov Abstract For a graph G, let p i (G), i = 0,..., be the probability that three distinct random vertices span
More informationCHROMATIC ROOTS AND LIMITS OF DENSE GRAPHS
CHROMATIC ROOTS AND LIMITS OF DENSE GRAPHS PÉTER CSIKVÁRI, PÉTER E. FRENKEL, JAN HLADKÝ, AND TAMÁS HUBAI Abstract. In this short note we observe that recent results of Abért and Hubai and of Csikvári and
More informationLecture 4: Graph Limits and Graphons
Lecture 4: Graph Limits and Graphons 36-781, Fall 2016 3 November 2016 Abstract Contents 1 Reprise: Convergence of Dense Graph Sequences 1 2 Calculating Homomorphism Densities 3 3 Graphons 4 4 The Cut
More informationarxiv: v1 [math.co] 24 Apr 2014
On sets of integers with restrictions on their products Michael Tait, Jacques Verstraëte Department of Mathematics University of California at San Diego 9500 Gilman Drive, La Jolla, California 9093-011,
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationHypergraph Turán Problems (IPAM Tutorial)
(IPAM Tutorial) Peter Keevash School of Mathematical Sciences, Queen Mary, University of London. p.keevash@qmul.ac.uk Introduction: From graphs to hypergraphs Mantel s Theorem (1907) The largest graph
More informationAdding random edges to create the square of a Hamilton cycle
Adding random edges to create the square of a Hamilton cycle Patrick Bennett Andrzej Dudek Alan Frieze October 7, 2017 Abstract We consider how many random edges need to be added to a graph of order n
More informationA LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH
A LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH AMIR DEMBO AND EYAL LUBETZKY Abstract. Starting with the large deviation principle (ldp) for the Erdős Rényi binomial random graph G(n,
More informationQUASIRANDOM PERMUTATIONS ARE CHARACTERIZED BY 4-POINT DENSITIES. 1 Introduction
Geom. Funct. Anal. Vol. 23 (2013) 570 579 DOI: 10.1007/s00039-013-0216-9 Published online March 19, 2013 c 2013 The Author(s). This article is published with open access at Springerlink.com GAFA Geometric
More informationThe regularity method and blow-up lemmas for sparse graphs
The regularity method and blow-up lemmas for sparse graphs Y. Kohayakawa (São Paulo) SPSAS Algorithms, Combinatorics and Optimization University of São Paulo July 2016 Partially supported CAPES/DAAD (430/15),
More informationA NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 A NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES OLEG PIKHURKO Abstract. The Turán function ex(n, F
More informationOn the 3-Local Profiles of Graphs
On the -Local Profiles of Graphs Hao Huang, Nati Linial, 2 Humberto Naves, Yuval Peled, 4 and Benny Sudakov 5,6 SCHOOL OF MATHEMATICS INSTITUTE FOR ADVANCED STUDY PRINCETON, NJ 08540 E-mail: huanghao@math.ias.edu
More informationExtremal Combinatorics, Graph Limits and Computational Complexity
Extremal Combinatorics, Graph Limits and Computational Complexity Jonathan A. Noel Christ Church University of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity 2016 Acknowledgements
More informationInduced subgraphs with many repeated degrees
Induced subgraphs with many repeated degrees Yair Caro Raphael Yuster arxiv:1811.071v1 [math.co] 17 Nov 018 Abstract Erdős, Fajtlowicz and Staton asked for the least integer f(k such that every graph with
More informationFirst Order Convergence and Roots
Article First Order Convergence and Roots Christofides, Demetres and Kral, Daniel Available at http://clok.uclan.ac.uk/17855/ Christofides, Demetres and Kral, Daniel (2016) First Order Convergence and
More informationTiling on multipartite graphs
Tiling on multipartite graphs Ryan Martin Mathematics Department Iowa State University rymartin@iastate.edu SIAM Minisymposium on Graph Theory Joint Mathematics Meetings San Francisco, CA Ryan Martin (Iowa
More informationSzemerédi s regularity lemma revisited. Lewis Memorial Lecture March 14, Terence Tao (UCLA)
Szemerédi s regularity lemma revisited Lewis Memorial Lecture March 14, 2008 Terence Tao (UCLA) 1 Finding models of large dense graphs Suppose we are given a large dense graph G = (V, E), where V is a
More informationarxiv: v3 [math.pr] 18 Aug 2017
Sparse Exchangeable Graphs and Their Limits via Graphon Processes arxiv:1601.07134v3 [math.pr] 18 Aug 2017 Christian Borgs Microsoft Research One Memorial Drive Cambridge, MA 02142, USA Jennifer T. Chayes
More informationConvergent sequences of dense graphs II. Multiway cuts and statistical physics
Annals of Mathematics 176 (2012), 151 219 http://dx.doi.org/10.4007/annals.2012.176.1.2 Convergent sequences of dense graphs II. Multiway cuts and statistical physics By C. Borgs, J. T. Chayes, L. Lovász,
More informationClique is hard on average for regular resolution
Clique is hard on average for regular resolution Ilario Bonacina, UPC Barcelona Tech July 27, 2018 Oxford Complexity Day Talk based on a joint work with: A. Atserias S. de Rezende J. Nordstro m M. Lauria
More informationStatistical Inference on Large Contingency Tables: Convergence, Testability, Stability. COMPSTAT 2010 Paris, August 23, 2010
Statistical Inference on Large Contingency Tables: Convergence, Testability, Stability Marianna Bolla Institute of Mathematics Budapest University of Technology and Economics marib@math.bme.hu COMPSTAT
More informationGround states for exponential random graphs
Ground states for exponential random graphs Mei Yin Department of Mathematics, University of Denver March 5, 2018 We propose a perturbative method to estimate the normalization constant in exponential
More informationThe step Sidorenko property and non-norming edge-transitive graphs
arxiv:1802.05007v3 [math.co] 5 Oct 2018 The step Sidorenko property and non-norming edge-transitive graphs Daniel Král Taísa L. Martins Péter Pál Pach Marcin Wrochna Abstract Sidorenko s Conjecture asserts
More informationINSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES. Cut distance identifying graphon parameters over weak* limits
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES Cut distance identifying graphon parameters over weak* limits Martin Doležal Jan Grebík Jan Hladký Israel Rocha Václav Rozhoň Preprint No. 49-2018
More informationPanHomc'r I'rui;* :".>r '.a'' W"»' I'fltolt. 'j'l :. r... Jnfii<on. Kslaiaaac. <.T i.. %.. 1 >
5 28 (x / &» )»(»»» Q ( 3 Q» (» ( (3 5» ( q 2 5 q 2 5 5 8) 5 2 2 ) ~ ( / x {» /»»»»» (»»» ( 3 ) / & Q ) X ] Q & X X X x» 8 ( &» 2 & % X ) 8 x & X ( #»»q 3 ( ) & X 3 / Q X»»» %» ( z 22 (»» 2» }» / & 2 X
More informationDelsarte s linear programming bound
15-859 Coding Theory, Fall 14 December 5, 2014 Introduction For all n, q, and d, Delsarte s linear program establishes a series of linear constraints that every code in F n q with distance d must satisfy.
More informationConvergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics
Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics C. Borgs a, J.T. Chayes a, L. Lovász a,c, V.T. Sós b, K. Vesztergombi c a Microsoft Research, One Microsoft Way, Redmond,
More informationThe typical structure of sparse K r+1 -free graphs
The typical structure of sparse K r+1 -free graphs Lutz Warnke University of Cambridge (joint work with József Balogh, Robert Morris, and Wojciech Samotij) H-free graphs / Turán s theorem Definition Let
More informationConvergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
Advances in Mathematics 219 2008) 1801 1851 www.elsevier.com/locate/aim Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing C. Borgs a, J.T. Chayes a,,l.lovász a,1,v.t.sós
More informationInformation Theory + Polyhedral Combinatorics
Information Theory + Polyhedral Combinatorics Sebastian Pokutta Georgia Institute of Technology ISyE, ARC Joint work Gábor Braun Information Theory in Complexity Theory and Combinatorics Simons Institute
More informationOn subgraphs of large girth
1/34 On subgraphs of large girth In Honor of the 50th Birthday of Thomas Vojtěch Rödl rodl@mathcs.emory.edu joint work with Domingos Dellamonica May, 2012 2/34 3/34 4/34 5/34 6/34 7/34 ARRANGEABILITY AND
More informationSparse halves in dense triangle-free graphs
Sparse halves in dense triangle-free graphs Sergey Norin and Liana Yepremyan 2 Department of Mathematics and Statistics, McGill University 2 School of Computer Science, McGill University arxiv:3.588v2
More informationDistinct edge weights on graphs
of Distinct edge weights on University of California-San Diego mtait@math.ucsd.edu Joint work with Jacques Verstraëte November 4, 2014 (UCSD) of November 4, 2014 1 / 46 Overview of 1 2 3 Product-injective
More informationThe Zarankiewicz problem in 3-partite graphs
The Zarankiewicz problem in 3-partite graphs Michael Tait Carnegie Mellon University mtait@cmu.edu AMS Eastern Fall Sectional University of Delaware September 29, 2018 Michael Tait (CMU) September 29,
More informationA reverse Sidorenko inequality Independent sets, colorings, and graph homomorphisms
A reverse Sidorenko inequality Independent sets, colorings, and graph homomorphisms Yufei Zhao (MIT) Joint work with Ashwin Sah (MIT) Mehtaab Sawhney (MIT) David Stoner (Harvard) Question Fix d. Which
More informationRandom Graphs III. Y. Kohayakawa (São Paulo) Chorin, 4 August 2006
Y. Kohayakawa (São Paulo) Chorin, 4 August 2006 Outline 1 Outline of Lecture III 1. Subgraph containment with adversary: Existence of monoχ subgraphs in coloured random graphs; properties of the form G(n,
More informationPositive graphs. Omar Antolín Camarena, Endre Csóka, Tamás Hubai, Gábor Lippner, László Lovász. May 2012
Positive graphs arxiv:1205.6510v2 [math.co] 30 Jan 2014 Omar Antolín Camarena, Endre Csóka, Tamás Hubai, Gábor Lippner, László Lovász May 2012 Abstract We study positive graphs that have a nonnegative
More informationRECAP: Extremal problems Examples
RECAP: Extremal problems Examples Proposition 1. If G is an n-vertex graph with at most n edges then G is disconnected. A Question you always have to ask: Can we improve on this proposition? Answer. NO!
More informationMultipodal Structure and Phase Transitions in Large Constrained Graphs
Multipodal Structure and Phase Transitions in Large Constrained Graphs Richard Kenyon Charles Radin Kui Ren Lorenzo Sadun May 3, 24 Abstract We study the asymptotics of large, simple, labeled graphs constrained
More informationPacking nearly optimal Ramsey R(3, t) graphs
Packing nearly optimal Ramsey R(3, t) graphs He Guo Joint work with Lutz Warnke Context of this talk Ramsey number R(s, t) R(s, t) := minimum n N such that every red/blue edge-coloring of complete n-vertex
More informationSzemerédi s Lemma for the Analyst
Szemerédi s Lemma for the Analyst László Lovász and Balázs Szegedy Microsoft Research February 6 Abstract Szemerédi s Regularity Lemma is a fundamental tool in graph theory: it has many applications to
More informationMonochromatic triangles in three-coloured graphs
Charles University, Prague 10th September 2012 Joint work with James Cummings (Carnegie Mellon), Daniel Král (Charles University), Florian Pfender (Colorado), Konrad Sperfeld (Universität Rostock) and
More informationPacking nearly optimal Ramsey R(3, t) graphs
Packing nearly optimal Ramsey R(3, t) graphs He Guo Georgia Institute of Technology Joint work with Lutz Warnke Context of this talk Ramsey number R(s, t) R(s, t) := minimum n N such that every red/blue
More informationColoring Simple Hypergraphs
Department of Mathematics, Statistics and Computer Science University of Illinois Chicago May 13, 2011 A Puzzle Problem Let n 2 and suppose that S [n] [n] with S 2n 1. Then some three points in S determine
More informationarxiv: v1 [math.co] 29 Nov 2018
ON THE INDUCIBILITY OF SMALL TREES AUDACE A. V. DOSSOU-OLORY AND STEPHAN WAGNER arxiv:1811.1010v1 [math.co] 9 Nov 018 Abstract. The quantity that captures the asymptotic value of the maximum number of
More informationRamsey theory and the geometry of Banach spaces
Ramsey theory and the geometry of Banach spaces Pandelis Dodos University of Athens Maresias (São Paulo), August 25 29, 2014 1.a. The Hales Jewett theorem The following result is due to Hales & Jewett
More informationarxiv: v2 [math.co] 11 Mar 2008
Testing properties of graphs and functions arxiv:0803.1248v2 [math.co] 11 Mar 2008 Contents László Lovász Institute of Mathematics, Eötvös Loránd University, Budapest and Balázs Szegedy Department of Mathematics,
More informationAsymptotics and Extremal Properties of the Edge-Triangle Exponential Random Graph Model
Asymptotics and Extremal Properties of the Edge-Triangle Exponential Random Graph Model Alessandro Rinaldo Carnegie Mellon University joint work with Mei Yin, Sukhada Fadnavis, Stephen E. Fienberg and
More informationThe regularity method and blow-up lemmas for sparse graphs
The regularity method and blow-up lemmas for sparse graphs Y. Kohayakawa (São Paulo) SPSAS Algorithms, Combinatorics and Optimization University of São Paulo July 2016 Partially supported CAPES/DAAD (430/15),
More informationCounting substructures II: hypergraphs
Counting substructures II: hypergraphs Dhruv Mubayi December, 01 Abstract For various k-uniform hypergraphs F, we give tight lower bounds on the number of copies of F in a k-uniform hypergraph with a prescribed
More informationMoments of Two-Variable Functions and the Uniqueness of Graph Limits
Moments of Two-Variable Functions and the Uniqueness of Graph Limits Christian Borgs Jennifer Chayes László Lovász Microsoft Research, Redmond, WA 98052 October 2008; revised May 2009 Abstract For a symmetric
More informationCombinatorics in Hungary and Extremal Set Theory
Combinatorics in Hungary and Extremal Set Theory Gyula O.H. Katona Rényi Institute, Budapest Jiao Tong University Colloquium Talk October 22, 2014 Combinatorics in Hungary A little history. 1 Combinatorics
More informationJacques Verstraëte
2 - Turán s Theorem Jacques Verstraëte jacques@ucsd.edu 1 Introduction The aim of this section is to state and prove Turán s Theorem [17] and to discuss some of its generalizations, including the Erdős-Stone
More informationSupersaturation in the Boolean lattice
Supersaturation in the Boolean lattice Andrew P. Dove Jerrold R. Griggs Ross J. Kang Jean-Sébastien Sereni March 18, 013 Abstract We prove a supersaturation-type extension of both Sperner s Theorem 198
More informationOn the number of edge-disjoint triangles in K 4 -free graphs
On the number of edge-disjoint triangles in K 4 -free graphs arxiv:1506.03306v1 [math.co] 10 Jun 2015 Ervin Győri Rényi Institute Hungarian Academy of Sciences Budapest, Hungary gyori.ervin@renyi.mta.hu
More informationAdditive Combinatorics and Computational Complexity
Additive Combinatorics and Computational Complexity Luca Trevisan U.C. Berkeley Ongoing joint work with Omer Reingold, Madhur Tulsiani, Salil Vadhan Combinatorics: Studies: Graphs, hypergraphs, set systems
More informationCombinatorial Commutative Algebra, Graph Colorability, and Algorithms
I G,k = g 1,...,g n Combinatorial Commutative Algebra, Graph Colorability, and Algorithms Chris Hillar (University of California, Berkeley) Joint with Troels Windfeldt! (University of Copenhagen)! Outline
More informationColoring Simple Hypergraphs
Department of Mathematics, Statistics and Computer Science University of Illinois Chicago August 28, 2010 Problem Let n 2 and suppose that S [n] [n] with S 2n 1. Then some three points in S determine a
More informationOn the Logarithmic Calculus and Sidorenko s Conjecture
On the Logarithmic Calculus and Sidorenko s Conjecture by Xiang Li A thesis submitted in conformity with the requirements for the degree of Msc. Mathematics Graduate Department of Mathematics University
More informationRamsey-type problem for an almost monochromatic K 4
Ramsey-type problem for an almost monochromatic K 4 Jacob Fox Benny Sudakov Abstract In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph K n with
More informationDisjoint Subgraphs in Sparse Graphs 1
Disjoint Subgraphs in Sparse Graphs 1 Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 OWB, UK jbav2@dpmms.cam.ac.uk
More informationGraph homomorphisms. Peter J. Cameron. Combinatorics Study Group Notes, September 2006
Graph homomorphisms Peter J. Cameron Combinatorics Study Group Notes, September 2006 Abstract This is a brief introduction to graph homomorphisms, hopefully a prelude to a study of the paper [1]. 1 Homomorphisms
More informationEducjatipnal. L a d ie s * COBNWALILI.S H IG H SCHOOL. I F O R G IR L S A n B k i n d e r g a r t e n.
- - - 0 x ] - ) ) -? - Q - - z 0 x 8 - #? ) 80 0 0 Q ) - 8-8 - ) x ) - ) -] ) Q x?- x - - / - - x - - - x / /- Q ] 8 Q x / / - 0-0 0 x 8 ] ) / - - /- - / /? x ) x x Q ) 8 x q q q )- 8-0 0? - Q - - x?-
More informationCUT DISTANCE IDENTIFYING GRAPHON PARAMETERS OVER WEAK* LIMITS MARTIN DOLEŽAL, JAN GREBÍK, JAN HLADKÝ, ISRAEL ROCHA, VÁCLAV ROZHOŇ
CUT DISTACE IDETIFYIG GRAPHO PARAMETERS OVER WEAK* LIMITS MARTI DOLEŽAL, JA GREBÍK, JA HLADKÝ, ISRAEL ROCHA, VÁCLAV ROZHOŇ ABSTRACT. The theory of graphons comes with the so-called cut distance. The cut
More informationarxiv: v1 [math.co] 19 Dec 2013
GRAPH PROPERTIES, GRAPH LIMITS AND ENTROPY arxiv:1312.5626v1 [math.co] 19 Dec 2013 HAMED HATAMI, SVANTE JANSON, AND BALÁZS SZEGEDY Abstract. We study the relation between the growth rate of a graph property
More informationA = A U. U [n] P(A U ). n 1. 2 k(n k). k. k=1
Lecture I jacques@ucsd.edu Notation: Throughout, P denotes probability and E denotes expectation. Denote (X) (r) = X(X 1)... (X r + 1) and let G n,p denote the Erdős-Rényi model of random graphs. 10 Random
More informationarxiv: v2 [math.pr] 4 Jan 2018
Ground states for exponential random graphs Rajinder Mavi 1, a 2, b and Mei Yin 1 Department of Mathematics Michigan State University 619 Red Cedar Road arxiv:1706.09084v2 [math.pr] 4 Jan 2018 C212 Wells
More informationPacking k-partite k-uniform hypergraphs
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 38 (2011) 663 668 www.elsevier.com/locate/endm Packing k-partite k-uniform hypergraphs Richard Mycroft 1 School of Mathematical
More informationForbidding complete hypergraphs as traces
Forbidding complete hypergraphs as traces Dhruv Mubayi Department of Mathematics, Statistics, and Computer Science University of Illinois Chicago, IL 60607 Yi Zhao Department of Mathematics and Statistics
More informationAn asymptotic multipartite Kühn-Osthus theorem
An asymptotic multipartite Kühn-Osthus theorem Ryan R. Martin 1 Richard Mycroft 2 Jozef Skokan 3 1 Iowa State University 2 University of Birmingham 3 London School of Economics 08 August 2017 Algebraic
More informationTurán numbers of expanded hypergraph forests
Turán numbers of expanded forests Rényi Institute of Mathematics, Budapest, Hungary Probabilistic and Extremal Combinatorics, IMA, Minneapolis, Sept. 9, 2014. Main results are joint with Tao JIANG, Miami
More informationarxiv: v2 [math.pr] 22 Oct 2018
Breaking of ensemble equivalence for perturbed Erdős-Rényi random graphs arxiv:807.07750v [math.pr] Oct 08 F. den Hollander M. Mandjes A. Roccaverde 3 N.J. Starreveld 4 October 3, 08 Abstract In a previous
More informationThe typical structure of graphs without given excluded subgraphs + related results
The typical structure of graphs without given excluded subgraphs + related results Noga Alon József Balogh Béla Bollobás Jane Butterfield Robert Morris Dhruv Mubayi Wojciech Samotij Miklós Simonovits.
More informationContainment restrictions
Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation
More informationLARGE GRAPHS AND THE RELATIONSHIP BETWEEN EDGE AND TRIANGLE DENSITY
LARGE GRAPHS AND THE RELATIONSHIP BETWEEN EDGE AND TRIANGLE DENSITY Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Bachelor of Arts in Mathematics
More informationOn two problems in Ramsey-Turán theory
On two problems in Ramsey-Turán theory József Balogh Hong Liu Maryam Sharifzadeh July 7, 016 Abstract Alon, Balogh, Keevash and Sudakov proved that the (k 1)-partite Turán graph maximizes the number of
More informationVertex order in some large constrained random graphs
Vertex order in some large constrained random graphs Hans Koch Abstract. In large random graphs with fixed edge density and triangle density, it has been observed numerically [9] that a typical graph is
More informationA note on the number of additive triples in subsets of integers
A note on the number of additive triples in subsets of integers Katherine Staden Mathematics Institute and DIMAP University of Warwick Coventry CV4 7AL, UK Abstract An additive triple in a set A of integers
More informationarxiv: v2 [math.co] 20 Jun 2018
ON ORDERED RAMSEY NUMBERS OF BOUNDED-DEGREE GRAPHS MARTIN BALKO, VÍT JELÍNEK, AND PAVEL VALTR arxiv:1606.0568v [math.co] 0 Jun 018 Abstract. An ordered graph is a pair G = G, ) where G is a graph and is
More informationPacking transitive triples in a tournament
Packing transitive triples in a tournament Mohamad Kabiya Raphael Yuster Abstract We prove that a tournament with n vertices has more than 41 300 n2 (1 o(1)) arc-disjoint transitive triples, and more than
More information