Every flock generalised quadrangle has a hemisystem

Every Large Point Set contains Many Collinear Points or an Empty Pentagon

Every longest circuit of a 3-connected, $K_{3,3}$-minor free graph has a chord

Every Minor-Closed Property of Sparse Graphs is Testable

Every non-Euclidean oriented matroid admits a biquadratic final polynomial

Every planar graph without adjacent short cycles is 3-colorable

Every plane graph of maximum degree 8 has an edge-face 9-colouring

Every rayless graph has an unfriendly partition

Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable

Everywhere complex sequences and probabilistic method

Evolving Graph Representation and Visualization

Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs

Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps

Exact Euler Maclaurin formulas for simple lattice polytopes

Exact expectations for random graphs and assignments

Exact generating function for 2-convex polygons

Exact Sequences for the Homology of the Matching Complex

Exact solution of the hypergraph Turán problem for $k$-uniform linear paths

Exact solution of two classes of prudent polygons

Exactly solved models of polyominoes and polygons