5,488 research outputs found
The history of degenerate (bipartite) extremal graph problems
This paper is a survey on Extremal Graph Theory, primarily focusing on the
case when one of the excluded graphs is bipartite. On one hand we give an
introduction to this field and also describe many important results, methods,
problems, and constructions.Comment: 97 pages, 11 figures, many problems. This is the preliminary version
of our survey presented in Erdos 100. In this version 2 only a citation was
complete
Breaking Symmetries in Graph Representation
There are many complex combinatorial problems
which involve searching for an undirected graph
satisfying a certain property. These problems are
often highly challenging because of the large number
of isomorphic representations of a possible solution.
In this paper we introduce novel, effective
and compact, symmetry breaking constraints for
undirected graph search. While incomplete, these
prove highly beneficial in pruning the search for a
graph. We illustrate the application of symmetry
breaking in graph representation to resolve several
open instances in extremal graph theory
Extremal higher codimension cycles on moduli spaces of curves
We show that certain geometrically defined higher codimension cycles are
extremal in the effective cone of the moduli space of stable genus curves with ordered marked points. In
particular, we prove that codimension two boundary strata are extremal and
exhibit extremal boundary strata of higher codimension. We also show that the
locus of hyperelliptic curves with a marked Weierstrass point in
and the locus of hyperelliptic curves in
are extremal cycles. In addition, we exhibit
infinitely many extremal codimension two cycles in for and in for .Comment: 25 page
Hamilton cycles in hypergraphs below the Dirac threshold
We establish a precise characterisation of -uniform hypergraphs with
minimum codegree close to which contain a Hamilton -cycle. As an
immediate corollary we identify the exact Dirac threshold for Hamilton
-cycles in -uniform hypergraphs. Moreover, by derandomising the proof of
our characterisation we provide a polynomial-time algorithm which, given a
-uniform hypergraph with minimum codegree close to , either finds a
Hamilton -cycle in or provides a certificate that no such cycle exists.
This surprising result stands in contrast to the graph setting, in which below
the Dirac threshold it is NP-hard to determine if a graph is Hamiltonian. We
also consider tight Hamilton cycles in -uniform hypergraphs for , giving a series of reductions to show that it is NP-hard to determine
whether a -uniform hypergraph with minimum degree contains a tight Hamilton cycle. It is therefore
unlikely that a similar characterisation can be obtained for tight Hamilton
cycles.Comment: v2: minor revisions in response to reviewer comments, most pseudocode
and details of the polynomial time reduction moved to the appendix which will
not appear in the printed version of the paper. To appear in Journal of
Combinatorial Theory, Series
- …