Almost all H-free graphs have the Erd˝os-Hajnal property Martin Loebl∗, Bruce Reed†, Alex Scott‡, Andrew Thomason§and St´ephan Thomass´e¶ Abstract

Source URL: perso.ens-lyon.fr

Crossing numbers of imbalanced graphs J´anos Pach∗ Courant Institute, NYU and R´enyi Institute, Budapest J´ozsef Solymosi† University of British Columbia, Vancouver G´abor Tardos‡

Source URL: www.renyi.hu

Reverse Mathematics and the Coloring Number of Graphs Matthew A. Jura, Ph.D. University of Connecticut, 2009

Source URL: www.math.uconn.edu

• Graph theory
• Graph coloring
• Degeneracy
• Graph minor

Polychromatic Colorings of Plane Graphs Noga Alon ∗ Robert Berke † Saswata Shannigrahi ¶ Kevin Buchin ‡

Source URL: www.math.tau.ac.il

A BLOW-UP LEMMA FOR APPROXIMATE DECOMPOSITIONS ¨ JAEHOON KIM, DANIELA KUHN, DERYK OSTHUS, AND MYKHAYLO TYOMKYN Abstract. We develop a new method for constructing approximate decompositions of dense graphs into sparse gr

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

´ ON POSA’S CONJECTURE FOR RANDOM GRAPHS ¨ DANIELA KUHN AND DERYK OSTHUS

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

Undirected Connectivity in Log-Space∗ Omer Reingold† May 3, 2008 Abstract We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs.

Source URL: omereingold.files.wordpress.com

GENERALIZED PIGEONHOLE PROPERTIES OF GRAPHS AND ORIENTED GRAPHS ´ AND STEPHAN ´ ANTHONY BONATO, PETER CAMERON, DEJAN DELIC, ´

Source URL: perso.ens-lyon.fr

Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs∗ Iyad Kanj1 , Christian Komusiewicz2 , Manuel Sorge3 , and Erik Jan van Leeuwen4 1 2

Source URL: users.minet.uni-jena.de

• Graph theory
• Cluster graph
• Matching
• Clique
• Ear decomposition
• Neighbourhood
• NP-complete problems
• Line graph
• Graph coloring

TREE-MINIMAL GRAPHS ARE ALMOST REGULAR D. DELLAMONICA JR., P. HAXELL, T. LUCZAK, D. MUBAYI, B. NAGLE, ¨ Y. PERSON, V. RODL, AND M. SCHACHT Abstract. For all fixed trees T and any graph G we derive a counting

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