147 research outputs found
Embedding large subgraphs into dense graphs
What conditions ensure that a graph G contains some given spanning subgraph
H? The most famous examples of results of this kind are probably Dirac's
theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect
matchings are generalized by perfect F-packings, where instead of covering all
the vertices of G by disjoint edges, we want to cover G by disjoint copies of a
(small) graph F. It is unlikely that there is a characterization of all graphs
G which contain a perfect F-packing, so as in the case of Dirac's theorem it
makes sense to study conditions on the minimum degree of G which guarantee a
perfect F-packing.
The Regularity lemma of Szemeredi and the Blow-up lemma of Komlos, Sarkozy
and Szemeredi have proved to be powerful tools in attacking such problems and
quite recently, several long-standing problems and conjectures in the area have
been solved using these. In this survey, we give an outline of recent progress
(with our main emphasis on F-packings, Hamiltonicity problems and tree
embeddings) and describe some of the methods involved
The uniform face ideals of a simplicial complex
We define the uniform face ideal of a simplicial complex with respect to an
ordered proper vertex colouring of the complex. This ideal is a monomial ideal
which is generally not squarefree. We show that such a monomial ideal has a
linear resolution, as do all of its powers, if and only if the colouring
satisfies a certain nesting property.
In the case when the colouring is nested, we give a minimal cellular
resolution supported on a cubical complex. From this, we give the graded Betti
numbers in terms of the face-vector of the underlying simplicial complex.
Moreover, we explicitly describe the Boij-S\"oderberg decompositions of both
the ideal and its quotient. We also give explicit formul\ae\ for the
codimension, Krull dimension, multiplicity, projective dimension, depth, and
regularity. Further still, we describe the associated primes, and we show that
they are persistent.Comment: 34 pages, 8 figure
Percolation on self-dual polygon configurations
Recently, Scullard and Ziff noticed that a broad class of planar percolation
models are self-dual under a simple condition that, in a parametrized version
of such a model, reduces to a single equation. They state that the solution of
the resulting equation gives the critical point. However, just as in the
classical case of bond percolation on the square lattice, self-duality is
simply the starting point: the mathematical difficulty is precisely showing
that self-duality implies criticality. Here we do so for a generalization of
the models considered by Scullard and Ziff. In these models, the states of the
bonds need not be independent; furthermore, increasing events need not be
positively correlated, so new techniques are needed in the analysis. The main
new ingredients are a generalization of Harris's Lemma to products of partially
ordered sets, and a new proof of a type of Russo-Seymour-Welsh Lemma with
minimal symmetry assumptions.Comment: Expanded; 73 pages, 24 figure
New bounds for odd colourings of graphs
Given a graph , a vertex-colouring of , and a subset
, a colour is said to be \emph{odd} for
in if it has an odd number of occurrences in . We say that
is an \emph{odd colouring} of if it is proper and every (open)
neighbourhood has an odd colour in . The odd chromatic number of a
graph , denoted by , is the minimum such that an
odd colouring exists. In a recent paper, Caro,
Petru\v sevski and \v Skrekovski conjectured that every connected graph of
maximum degree has odd-chromatic number at most . We
prove that this conjecture holds asymptotically: for every connected graph
with maximum degree , as . We also prove that for every
. If moreover the minimum degree of is sufficiently large,
we have and . Finally, given an integer , we study the
generalisation of these results to -odd colourings, where every vertex
must have at least odd colours in its neighbourhood. Many
of our results are tight up to some multiplicative constant
- …