Edge-decomposition of graphs into copies of a tree with four edges

Edge-disjoint Hamilton cycles in graphs

Edge-disjoint Hamilton cycles in random graphs

Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets

Edge-intersection graphs of grid paths: the bend-number

Edge-isoperimetric inequalities and influences

Edge-isoperimetric problem for Cayley graphs and generalized Takagi function

Edge-local equivalence of graphs

Edge-Removal and Non-Crossing Perfect Matchings

Edge-Transitive Homogeneous Factorisations of Complete Graphs

Edges of the Barvinok-Novik orbitope

Edit Distance between Unlabeled Ordered Trees

Effective Scalar Products for D-finite Symmetric Functions

Efficient computation of resonance varieties via Grassmannians

Efficient Counting and Asymptotics of $k$-noncrossing tangled-diagrams

Efficient enumeration of graceful permutations

Efficient pooling designs for library screening

Ehrhart f*-coefficients of polytopal complexes are non-negative integers

Ehrhart Polynomial Roots and Stanley's Non-negativity Theorem

Ehrhart polynomials of convex polytopes with small volumes