Studying graphs and their induced subgraphs with the computer : GraphsInGraphs E. Camby1 , G. Caporossi2 1 Département de Mathématique, Université Libre de Bruxelles

Source URL: homepages.ulb.ac.be

OPTIMAL PACKINGS OF HAMILTON CYCLES IN GRAPHS OF HIGH MINIMUM DEGREE ¨ DANIELA KUHN, JOHN LAPINSKAS AND DERYK OSTHUS Abstract. We study the number of edge-disjoint Hamilton cycles one can guarantee in a sufficiently lar

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

Moore bound for irregular graphs Recall that we want to prove the following theorem: Theorem 1. Let G be an n-vertex graph with δ(g) ≥ 2, and with girth g(G) ≥ 2k + 1 and average degree d¯ = 2m n . Then k−1

Source URL: discretemath.imp.fu-berlin.de

Finding small stabilizers for unstable graphs Adrian Bock1 , Karthekeyan Chandrasekaran2 , Jochen K¨onemann3 , Britta Peis4 , Laura Sanit`a3 1 EPFL, Switzerland.

Source URL: www.math.uwaterloo.ca

BIPARTITE RIGIDITY GIL KALAI, ERAN NEVO, AND ISABELLA NOVIK Abstract. We develop a bipartite rigidity theory for bipartite graphs parallel to the classical rigidity theory for general graphs, and define for two positive

Source URL: www.math.washington.edu

Sparse random graphs on surfaces Mihyun Kang Based on joint work with M. Moßhammer and P. Sprüssel Graz University of Technology

Source URL: www.mathematik.uni-muenchen.de

MINIMUM H-DECOMPOSITIONS OF GRAPHS: EDGE-CRITICAL CASE ¨ LALE OZKAHYA AND YURY PERSON Abstract. For a given graph H let φH (n) be the maximum number of parts

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

The role of long cycles in excitable dynamics on graphs Guadalupe C. Garcia,1 Annick Lesne,2, 3 Claus C. Hilgetag,4, 5 and Marc-Thorsten H¨ utt1 1 School of Engineering and Science, Jacobs University Bremen ´

Source URL: www.lptl.jussieu.fr

On nearly regular co-critical graphs Tibor Szab´o The Ohio State University, Columbus, Ohio, 231 W 18th Ave, Columbus, Ohio, 43210, USA and E¨ otv¨

Source URL: page.mi.fu-berlin.de

Preferential Attachment in Graphs with Affinities Jay-Yoon Lee* Manzil Zaheer* Stephan G¨

Source URL: www.andrew.cmu.edu

• Graph theory
• Mathematics
• Line graph
• Graph
• Random graph
• Degree
• BarabsiAlbert model
• Pathwidth