60 research outputs found
Characterization and enumeration of toroidal K_{3,3}-subdivision-free graphs
We describe the structure of 2-connected non-planar toroidal graphs with no
K_{3,3}-subdivisions, using an appropriate substitution of planar networks into
the edges of certain graphs called toroidal cores. The structural result is
based on a refinement of the algorithmic results for graphs containing a fixed
K_5-subdivision in [A. Gagarin and W. Kocay, "Embedding graphs containing
K_5-subdivisions'', Ars Combin. 64 (2002), 33-49]. It allows to recognize these
graphs in linear-time and makes possible to enumerate labelled 2-connected
toroidal graphs containing no K_{3,3}-subdivisions and having minimum vertex
degree two or three by using an approach similar to [A. Gagarin, G. Labelle,
and P. Leroux, "Counting labelled projective-planar graphs without a
K_{3,3}-subdivision", submitted, arXiv:math.CO/0406140, (2004)].Comment: 18 pages, 7 figures and 4 table
Counting unlabelled toroidal graphs with no K33-subdivisions
We provide a description of unlabelled enumeration techniques, with complete
proofs, for graphs that can be canonically obtained by substituting 2-pole
networks for the edges of core graphs. Using structure theorems for toroidal
and projective-planar graphs containing no K33-subdivisions, we apply these
techniques to obtain their unlabelled enumeration.Comment: 25 pages (some corrections), 4 figures (one figure added), 3 table
Two-connected graphs with prescribed three-connected components
We adapt the classical 3-decomposition of any 2-connected graph to the case
of simple graphs (no loops or multiple edges). By analogy with the
block-cutpoint tree of a connected graph, we deduce from this decomposition a
bicolored tree tc(g) associated with any 2-connected graph g, whose white
vertices are the 3-components of g (3-connected components or polygons) and
whose black vertices are bonds linking together these 3-components, arising
from separating pairs of vertices of g. Two fundamental relationships on graphs
and networks follow from this construction. The first one is a dissymmetry
theorem which leads to the expression of the class B=B(F) of 2-connected
graphs, all of whose 3-connected components belong to a given class F of
3-connected graphs, in terms of various rootings of B. The second one is a
functional equation which characterizes the corresponding class R=R(F) of
two-pole networks all of whose 3-connected components are in F. All the
rootings of B are then expressed in terms of F and R. There follow
corresponding identities for all the associated series, in particular the edge
index series. Numerous enumerative consequences are discussed.Comment: Work presented at the Ottawa-Carleton Discrete Mathematics Workshop,
May 25-26, 2007 and at the Seminaire Lotharingien de Combinatoire, Bertinoro,
Italy, September 24-26, 2007. 32 pages. 11 pdf figures. Version 2: Minor
revisions, one Table adde
Asymptotic enumeration and limit laws for graphs of fixed genus
It is shown that the number of labelled graphs with n vertices that can be
embedded in the orientable surface S_g of genus g grows asymptotically like
where , and is the exponential growth rate of planar graphs. This generalizes the
result for the planar case g=0, obtained by Gimenez and Noy.
An analogous result for non-orientable surfaces is obtained. In addition, it
is proved that several parameters of interest behave asymptotically as in the
planar case. It follows, in particular, that a random graph embeddable in S_g
has a unique 2-connected component of linear size with high probability
A Complete Grammar for Decomposing a Family of Graphs into 3-connected Components
Tutte has described in the book "Connectivity in graphs" a canonical
decomposition of any graph into 3-connected components. In this article we
translate (using the language of symbolic combinatorics)
Tutte's decomposition into a general grammar expressing any family of graphs
(with some stability conditions) in terms of the 3-connected subfamily. A key
ingredient we use is an extension of the so-called dissymmetry theorem, which
yields negative signs in the grammar.
As a main application we recover in a purely combinatorial way the analytic
expression found by Gim\'enez and Noy for the series counting labelled planar
graphs (such an expression is crucial to do asymptotic enumeration and to
obtain limit laws of various parameters on random planar graphs). Besides the
grammar, an important ingredient of our method is a recent bijective
construction of planar maps by Bouttier, Di Francesco and Guitter.Comment: 39 page
Subset currents on free groups
We introduce and study the space of \emph{subset currents} on the free group
. A subset current on is a positive -invariant locally finite
Borel measure on the space of all closed subsets of consisting of at least two points. While ordinary geodesic currents
generalize conjugacy classes of nontrivial group elements, a subset current is
a measure-theoretic generalization of the conjugacy class of a nontrivial
finitely generated subgroup in , and, more generally, in a word-hyperbolic
group. The concept of a subset current is related to the notion of an
"invariant random subgroup" with respect to some conjugacy-invariant
probability measure on the space of closed subgroups of a topological group. If
we fix a free basis of , a subset current may also be viewed as an
-invariant measure on a "branching" analog of the geodesic flow space for
, whose elements are infinite subtrees (rather than just geodesic lines)
of the Cayley graph of with respect to .Comment: updated version; to appear in Geometriae Dedicat
- …