EDGE-DISJOINT HAMILTON CYCLES IN RANDOM GRAPHS ¨ FIACHRA KNOX, DANIELA KUHN AND DERYK OSTHUS Abstract. We show that provided log50 n/n ≤ p ≤ 1 − n−1/4 log9 n we can with high probability find a collection of bδ

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

EDGE-DISJOINT HAMILTON CYCLES IN GRAPHS ¨ DEMETRES CHRISTOFIDES, DANIELA KUHN AND DERYK OSTHUS Abstract. In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every α >

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

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 15213

Source URL: homepages.warwick.ac.uk

Teaching and Learning Guide 3: Linear Equations – Further TopicsActivity Sheet Solving simultaneous equations using graphs - ACTIVITIES Learning Outcomes LO1: Students learn how to solve simultaneous

Source URL: www.metalproject.co.uk

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions? Noga Alon1?? , Amin Coja-Oghlan2? ? ? , Hiˆe.p H`an3† , Mihyun Kang3‡ , Vojtˇech R¨odl4§ , and Mathias Schacht3¶ 1 Schoo

Source URL: www.math.tugraz.at

Institut f. GeometrieSeminarraum 2, Inst. f. Geometrie Minicolloquium on Graphs and Games

Source URL: www.geometrie.tugraz.at

Relaxed two-coloring of cubic graphs Robert Berke and Tibor Szab´o ∗ Abstract

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

Total domination of graphs and small transversals of hypergraphs. St´ephan Thomass´e∗ and Anders Yeo†

Source URL: perso.ens-lyon.fr

Inferring Coarse Views of Connectivity in Very Large Graphs Reza Motamedi, Reza Rejaie, Walter Willinger, Daniel Lowd, Roberto Gonzalez http://onrg.cs.uoregon.edu/WalkAbout

Source URL: mirage.cs.uoregon.edu

Sheep: A Scalable Distributed Graph Partitioner Daniel Margo Margo Seltzer Algorithm Problem

Source URL: acmsocc.github.io

• Graph theory
• NP-complete problems
• Bipartite graphs
• Graph
• Tree
• Graph coloring
• Pathwidth
• Modular decomposition