Existentially closed BIBD block-intersection graphs.
Existenz gewisser Konfigurationen in n-gesättigten Graphen und in Graphen genügend großer Kantendichte.
Exklusive Graphen und Hamiltonsche Graphen n-ten Grades I.
Exklusive Graphen und Hamiltonsche Graphen n-ten Grades II.
Expanding stars
Expansion and random walks in : I
We prove that the Cayley graphs of are expanders with respect to the projection of any fixed elements in generating a Zariski dense subgroup.
Expansion and random walks in : II
Expansion in finite simple groups of Lie type
We show that random Cayley graphs of finite simple (or semisimple) groups of Lie type of fixed rank are expanders. The proofs are based on the Bourgain-Gamburd method and on the main result of our companion paper [BGGT].
Expansion in , square-free
Let be a fixed symmetric finite subset of that generates a Zariski dense subgroup of when we consider it as an algebraic group over by restriction of scalars. We prove that the Cayley graphs of with respect to the projections of is an expander family if ranges over square-free ideals of if and is an arbitrary numberfield, or if and .
Expected lengths of minimum spanning trees for non-identical edge distributions.
Experimental comparison of 2-satisfiability algorithms
Experimental comparison of graph drawing algorithms for cubic graphs.
Experiments with the fixed-parameter approach for two-layer planarization.
Explicit Cayley covers of Kautz digraphs.
Explicit enumeration of triangulations with multiple boundaries.
Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.
Explicit Ramsey graphs and orthonormal labelings.
Exploiting the structure of conflict graphs in high level synthesis
In this paper we analyze the computational complexity of a processor optimization problem. Given operations with interval times in a branching flow graph, the problem is to find an assignment of the operations to a minimum number of processors. We analyze the complexity of this assignment problem for flow graphs with a constant number of program traces and a constant number of processors.
Exponents of two-colored digraphs
We consider the primitive two-colored digraphs whose uncolored digraph has vertices and consists of one -cycle and one -cycle. We give bounds on the exponents and characterizations of extremal two-colored digraphs.
Extended trees of graphs
An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.