82 research outputs found
Rooted structures in graphs: a project on Hadwiger's conjecture, rooted minors, and Tutte cycles
Hadwigers Vermutung ist eine der anspruchsvollsten Vermutungen für Graphentheoretiker und bietet eine weitreichende Verallgemeinerung des Vierfarbensatzes. Ausgehend von dieser offenen Frage der strukturellen Graphentheorie werden gewurzelte Strukturen in Graphen diskutiert. Eine Transversale einer Partition ist definiert als eine Menge, welche genau ein Element aus jeder Menge der Partition enthält und sonst nichts. Für einen Graphen G und eine Teilmenge T seiner Knotenmenge ist ein gewurzelter Minor von G ein Minor, der T als Transversale seiner Taschen enthält. Sei T eine Transversale einer Färbung eines Graphen, sodass es ein System von kanten-disjunkten Wegen zwischen allen Knoten aus T gibt; dann stellt sich die Frage, ob es möglich ist, die Existenz eines vollständigen, in T gewurzelten Minors zu gewährleisten. Diese Frage ist eng mit Hadwigers Vermutung verwoben: Eine positive Antwort würde Hadwigers Vermutung für eindeutig färbbare Graphen bestätigen. In dieser Arbeit wird ebendiese Fragestellung untersucht sowie weitere Konzepte vorgestellt, welche bekannte Ideen der strukturellen Graphentheorie um eine Verwurzelung erweitern. Beispielsweise wird diskutiert, inwiefern hoch zusammenhängende Teilmengen der Knotenmenge einen hoch zusammenhängenden, gewurzelten Minor erzwingen. Zudem werden verschiedene Ideen von Hamiltonizität in planaren und nicht-planaren Graphen behandelt.Hadwiger's Conjecture is one of the most tantalising conjectures for graph theorists and offers a far-reaching generalisation of the Four-Colour-Theorem. Based on this major issue in structural graph theory, this thesis explores rooted structures in graphs. A transversal of a partition is a set which contains exactly one element from each member of the partition and nothing else. Given a graph G and a subset T of its vertex set, a rooted minor of G is a minor such that T is a transversal of its branch set. Assume that a graph has a transversal T of one of its colourings such that there is a system of edge-disjoint paths between all vertices from T; it comes natural to ask whether such graphs contain a minor rooted at T. This question of containment is strongly related to Hadwiger's Conjecture; indeed, a positive answer would prove Hadwiger's Conjecture for uniquely colourable graphs. This thesis studies the aforementioned question and besides, presents several other concepts of attaching rooted relatedness to ideas in structural graph theory. For instance, whether a highly connected subset of the vertex set forces a highly connected rooted minor. Moreover, several ideas of Hamiltonicity in planar and non-planar graphs are discussed
The 2d-directed spanning forest converges to the Brownian web
The two-dimensional directed spanning forest (DSF) introduced by Baccelli and
Bordenave is a planar directed forest whose vertex set is given by a
homogeneous Poisson point process on . If the DSF
has direction , the ancestor of a vertex is
the nearest Poisson point (in the distance) having strictly larger
-coordinate. This construction induces complex geometrical dependencies. In
this paper we show that the collection of DSF paths, properly scaled, converges
in distribution to the Brownian web (BW). This verifies a conjecture made by
Baccelli and Bordenave in 2007
LIPIcs, Volume 258, SoCG 2023, Complete Volume
LIPIcs, Volume 258, SoCG 2023, Complete Volum
Complex hyperbolic volume and intersection of boundary divisors in moduli spaces of genus zero curves
We show that the complex hyperbolic metrics defined by Deligne-Mostow and
Thurston on are singular K\"ahler-Einstein metrics when
is embedded in the Deligne-Mumford-Knudsen
compactification . As a consequence, we obtain a
formula computing the volumes of with respect to these
metrics using intersection of boundary divisors of
. In the case of rational weights, following an
idea of Y. Kawamata, we show that these metrics actually represent the first
Chern class of some line bundles on , from which
other formulas computing the same volumes are derived.Comment: Added a new expression of the divisor whose self-intersection
computes the volume in Theorem 1.1. Exposition improve
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
- …