Einige Bemerkungen über freie Kategorien und freie Gruppoide
Either tournaments or algebras? (Preliminary communication)
El diámetro de ciertos digrafos circulantes de triple paso.
This paper studies some diameter-related properties of the 3-step circulant digraphs with set of vertices V≡ZN and steps (± a,b). More precisely, it concentrates upon maximizing their order N for any fixed value of their diameter k. In the proposed geometrical approach, each digraph is fully represented by a T-shape tile which tessellates periodically the plane. The study of these tiles leads to the optimal solutions.
Elementary proof of the reality of the zeros of beta-polynomials of complete graphs
Elementary proofs and the sums differences problem.
In this paper, we rule out the possibility that a certain method of proof in the sums differences conjecture can settle the Kakeya Conjecture.
Elevation of a graph
Elimination of local bridges
e-locally acyclic graphs
Elongation in a graph
Embedding a forest in a graph.
Embedding complete ternary trees into hypercubes
We inductively describe an embedding of a complete ternary tree Tₕ of height h into a hypercube Q of dimension at most ⎡(1.6)h⎤+1 with load 1, dilation 2, node congestion 2 and edge congestion 2. This is an improvement over the known embedding of Tₕ into Q. And it is very close to a conjectured embedding of Havel [3] which states that there exists an embedding of Tₕ into its optimal hypercube with load 1 and dilation 2. The optimal hypercube has dimension ⎡(log₂3)h⎤ ( = ⎡(1.585)h⎤) or ⎡(log₂3)h⎤+1....
Embedding graphs in their complements
Embedding infinite trees into a cube of infinite dimension
Embedding -quasistars into -cubes
Embedding the polytomic tree into the -cube
Embedding trees into block graphs
Embedding trees into clique-bridge-clique graphs
Embedding vertices at points: Few bends suffice for planar graphs.
Embeddings of 2-spheres in 4-manifolds.
Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups.