COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Quantitative quasirandomnessAdd to your list(s) Download to your calendar using vCal - Benny Sudakov (ETH Zurich)
- Thursday 05 November 2015, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason. A graph is quasirandom if its edge distribution is similar (in a well defined quantitative way) to that of a random graph with the same edge density. Classical results of Thomason and Chung-Graham-Wilson show that a variety of graph properties are equivalent to quasirandomness. On the other hand, in some known proofs the error terms which measure quasirandomness can change quite dramatically when going from one property to another which might be problematic in some applications. Simonovits and Sós proved that the property that all induced subgraphs have about the expected number of copies of a fixed graph H is quasirandom. However, their proof relies on the regularity lemma and gives a very weak estimate. They asked to find a new proof for this result with a better estimate. The purpose of this talk is to accomplish this. Joint work with D. Conlon and J. Fox This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsThe Kate Pretty Lecture Visual Rhetoric and modern South Asian history (2015-16) Biochem## Other talksHow India Became Democratic: Comparative Perspectives (Panel discussion led by Gary Gerstle and Tim Harper) Predictive modeling of hydrogen assisted cracking – a Micromechanics conquest Part IIB Poster Presentations The Anne McLaren Lecture: CRISPR-Cas Gene Editing: Biology, Technology and Ethics Ethics for the working mathematician, seminar 11: Winning with mathematics Single Molecule Spectroscopy |