ON THE VARIATIONAL PROBLEM FOR UPPER TAILS IN SPARSE RANDOM GRAPHS EYAL LUBETZKY AND YUFEI ZHAO Abstract. What is the probability that the number of triangles in Gn,p , the Erd˝ os-R´enyi random graph with edge density

Source URL: yufeizhao.com

Oberwolfach Report: Combinatorics and Probability, April 2013 Large deviations in random graphs Yufei Zhao (joint work with Eyal Lubetzky) The goal of this talk is to answer the following question of Chatterjee and Varad

Source URL: yufeizhao.com

Technische Universität München Fakultät für Mathematik Counting spanning trees in dense graphs Diplomarbeit

Source URL: www.math.uni-frankfurt.de

List of publications of Jaroslav Neˇ setˇ ril 1. K-chromatic graphs without cycles of length < 7, /in Russian/, Comment. Math. Univ. Carol., 7, /, Graphs with small asymetries. Comment. Math. Univ.

Source URL: kam.mff.cuni.cz

Noname manuscript No. (will be inserted by the editor) Finding small stabilizers for unstable graphs Adrian Bock · Karthekeyan Chandrasekaran · Jochen K¨

Source URL: www.math.uwaterloo.ca

FORBIDDING INDUCED EVEN CYCLES IN A GRAPH: TYPICAL STRUCTURE AND COUNTING ¨ JAEHOON KIM, DANIELA KUHN, DERYK OSTHUS, TIMOTHY TOWNSEND Abstract. We determine, for all k ≥ 6, the typical structure of graphs that do not

Source URL: web.mat.bham.ac.uk

Conflict-free colorings of graphs and hypergraphs J´anos Pach∗ EPFL, Lausanne and CCNY, New York G´abor Tardos† Simon Fraser University, Burnaby

Source URL: www.renyi.hu

MiMa Mathematics in the Making Project nLLP– 1-IT-COMENIUS-CMP MiMa Toolkit March 2015

Source URL: www.mathematicsinthemaking.eu

• Geometry
• Convex geometry
• Euclidean geometry
• Platonic solids
• Deltahedra
• Polyhedra
• Planar graphs
• Dice
• Regular icosahedron
• Nontransitive dice
• Polyhedron
• Icosahedron

Triangle factors of graphs without large independent sets and of weighted graphs J´ozsef Balogh∗ Theodore Molla†

Source URL: math.illinois.edu

JMLR: Workshop and Conference Proceedings vol 40:1–33, 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery ∗ Peter Chin

Source URL: jmlr.org

• Mathematics
• Graph theory
• Discrete mathematics
• NP-complete problems
• Combinatorics
• Partition of a set
• Planar separator theorem
• Graph coloring