4,179 research outputs found
Pseudo-random graphs
Random graphs have proven to be one of the most important and fruitful
concepts in modern Combinatorics and Theoretical Computer Science. Besides
being a fascinating study subject for their own sake, they serve as essential
instruments in proving an enormous number of combinatorial statements, making
their role quite hard to overestimate. Their tremendous success serves as a
natural motivation for the following very general and deep informal questions:
what are the essential properties of random graphs? How can one tell when a
given graph behaves like a random graph? How to create deterministically graphs
that look random-like? This leads us to a concept of pseudo-random graphs and
the aim of this survey is to provide a systematic treatment of this concept.Comment: 50 page
Triangle-Intersecting Families of Graphs
A family of graphs F is said to be triangle-intersecting if for any two
graphs G,H in F, the intersection of G and H contains a triangle. A conjecture
of Simonovits and Sos from 1976 states that the largest triangle-intersecting
families of graphs on a fixed set of n vertices are those obtained by fixing a
specific triangle and taking all graphs containing it, resulting in a family of
size (1/8) 2^{n choose 2}. We prove this conjecture and some generalizations
(for example, we prove that the same is true of odd-cycle-intersecting
families, and we obtain best possible bounds on the size of the family under
different, not necessarily uniform, measures). We also obtain stability
results, showing that almost-largest triangle-intersecting families have
approximately the same structure.Comment: 43 page
Phylogenetic toric varieties on graphs
We define phylogenetic projective toric model of a trivalent graph as a
generalization of a binary symmetric model of a trivalent phylogenetic tree.
Generators of the pro- jective coordinate ring of the models of graphs with one
cycle are explicitly described. The phylogenetic models of graphs with the same
topological invariants are deforma- tion equivalent and share the same Hilbert
function. We also provide an algorithm to compute the Hilbert function.Comment: 36 pages, improved expositio
Simplicial and Cellular Trees
Much information about a graph can be obtained by studying its spanning
trees. On the other hand, a graph can be regarded as a 1-dimensional cell
complex, raising the question of developing a theory of trees in higher
dimension. As observed first by Bolker, Kalai and Adin, and more recently by
numerous authors, the fundamental topological properties of a tree --- namely
acyclicity and connectedness --- can be generalized to arbitrary dimension as
the vanishing of certain cellular homology groups. This point of view is
consistent with the matroid-theoretic approach to graphs, and yields
higher-dimensional analogues of classical enumerative results including
Cayley's formula and the matrix-tree theorem. A subtlety of the
higher-dimensional case is that enumeration must account for the possibility of
torsion homology in trees, which is always trivial for graphs. Cellular trees
are the starting point for further high-dimensional extensions of concepts from
algebraic graph theory including the critical group, cut and flow spaces, and
discrete dynamical systems such as the abelian sandpile model.Comment: 39 pages (including 5-page bibliography); 5 figures. Chapter for
forthcoming IMA volume "Recent Trends in Combinatorics
Goldberg, Fuller, Caspar, Klug and Coxeter and a general approach to local symmetry-preserving operations
Cubic polyhedra with icosahedral symmetry where all faces are pentagons or
hexagons have been studied in chemistry and biology as well as mathematics. In
chemistry one of these is buckminsterfullerene, a pure carbon cage with maximal
symmetry, whereas in biology they describe the structure of spherical viruses.
Parameterized operations to construct all such polyhedra were first described
by Goldberg in 1937 in a mathematical context and later by Caspar and Klug --
not knowing about Goldberg's work -- in 1962 in a biological context. In the
meantime Buckminster Fuller also used subdivided icosahedral structures for the
construction of his geodesic domes. In 1971 Coxeter published a survey article
that refers to these constructions. Subsequently, the literature often refers
to the Goldberg-Coxeter construction. This construction is actually that of
Caspar and Klug. Moreover, there are essential differences between this
(Caspar/Klug/Coxeter) approach and the approaches of Fuller and of Goldberg. We
will sketch the different approaches and generalize Goldberg's approach to a
systematic one encompassing all local symmetry-preserving operations on
polyhedra
- …