4,002 research outputs found
Nested cycles in large triangulations and crossing-critical graphs
We show that every sufficiently large plane triangulation has a large
collection of nested cycles that either are pairwise disjoint, or pairwise
intersect in exactly one vertex, or pairwise intersect in exactly two vertices.
We apply this result to show that for each fixed positive integer , there
are only finitely many -crossing-critical simple graphs of average degree at
least six. Combined with the recent constructions of crossing-critical graphs
given by Bokal, this settles the question of for which numbers there is
an infinite family of -crossing-critical simple graphs of average degree
Random graph states, maximal flow and Fuss-Catalan distributions
For any graph consisting of vertices and edges we construct an
ensemble of random pure quantum states which describe a system composed of
subsystems. Each edge of the graph represents a bi-partite, maximally entangled
state. Each vertex represents a random unitary matrix generated according to
the Haar measure, which describes the coupling between subsystems. Dividing all
subsystems into two parts, one may study entanglement with respect to this
partition. A general technique to derive an expression for the average
entanglement entropy of random pure states associated to a given graph is
presented. Our technique relies on Weingarten calculus and flow problems. We
analyze statistical properties of spectra of such random density matrices and
show for which cases they are described by the free Poissonian
(Marchenko-Pastur) distribution. We derive a discrete family of generalized,
Fuss-Catalan distributions and explicitly construct graphs which lead to
ensembles of random states characterized by these novel distributions of
eigenvalues.Comment: 37 pages, 24 figure
Combinatorics and geometry of finite and infinite squaregraphs
Squaregraphs were originally defined as finite plane graphs in which all
inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e.,
the vertices not incident with the outer face) have degrees larger than three.
The planar dual of a finite squaregraph is determined by a triangle-free chord
diagram of the unit disk, which could alternatively be viewed as a
triangle-free line arrangement in the hyperbolic plane. This representation
carries over to infinite plane graphs with finite vertex degrees in which the
balls are finite squaregraphs. Algebraically, finite squaregraphs are median
graphs for which the duals are finite circular split systems. Hence
squaregraphs are at the crosspoint of two dualities, an algebraic and a
geometric one, and thus lend themselves to several combinatorial
interpretations and structural characterizations. With these and the
5-colorability theorem for circle graphs at hand, we prove that every
squaregraph can be isometrically embedded into the Cartesian product of five
trees. This embedding result can also be extended to the infinite case without
reference to an embedding in the plane and without any cardinality restriction
when formulated for median graphs free of cubes and further finite
obstructions. Further, we exhibit a class of squaregraphs that can be embedded
into the product of three trees and we characterize those squaregraphs that are
embeddable into the product of just two trees. Finally, finite squaregraphs
enjoy a number of algorithmic features that do not extend to arbitrary median
graphs. For instance, we show that median-generating sets of finite
squaregraphs can be computed in polynomial time, whereas, not unexpectedly, the
corresponding problem for median graphs turns out to be NP-hard.Comment: 46 pages, 14 figure
- …