2,702 research outputs found
Distance colouring without one cycle length
We consider distance colourings in graphs of maximum degree at most and
how excluding one fixed cycle length affects the number of colours
required as . For vertex-colouring and , if any two
distinct vertices connected by a path of at most edges are required to be
coloured differently, then a reduction by a logarithmic (in ) factor against
the trivial bound can be obtained by excluding an odd cycle length
if is odd or by excluding an even cycle length . For edge-colouring and , if any two distinct edges connected by
a path of fewer than edges are required to be coloured differently, then
excluding an even cycle length is sufficient for a logarithmic
factor reduction. For , neither of the above statements are possible
for other parity combinations of and . These results can be
considered extensions of results due to Johansson (1996) and Mahdian (2000),
and are related to open problems of Alon and Mohar (2002) and Kaiser and Kang
(2014).Comment: 14 pages, 1 figur
Decomposition of bounded degree graphs into -free subgraphs
We prove that every graph with maximum degree admits a partition of
its edges into parts (as ) none of which
contains as a subgraph. This bound is sharp up to a constant factor. Our
proof uses an iterated random colouring procedure.Comment: 8 pages; to appear in European Journal of Combinatoric
The t-stability number of a random graph
Given a graph G = (V,E), a vertex subset S is called t-stable (or
t-dependent) if the subgraph G[S] induced on S has maximum degree at most t.
The t-stability number of G is the maximum order of a t-stable set in G. We
investigate the typical values that this parameter takes on a random graph on n
vertices and edge probability equal to p. For any fixed 0 < p < 1 and fixed
non-negative integer t, we show that, with probability tending to 1 as n grows,
the t-stability number takes on at most two values which we identify as
functions of t, p and n. The main tool we use is an asymptotic expression for
the expected number of t-stable sets of order k. We derive this expression by
performing a precise count of the number of graphs on k vertices that have
maximum degree at most k. Using the above results, we also obtain asymptotic
bounds on the t-improper chromatic number of a random graph (this is the
generalisation of the chromatic number, where we partition of the vertex set of
the graph into t-stable sets).Comment: 25 pages; v2 has 30 pages and is identical to the journal version
apart from formatting and a minor amendment to Lemma 8 (and its proof on p.
21
Largest sparse subgraphs of random graphs
For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic
formula for the size of a largest vertex subset in G(n,p) that induces a
subgraph with average degree at most t, provided that p = p(n) is not too small
and t = t(n) is not too large. In the case of fixed t and p, we find that this
value is asymptotically almost surely concentrated on at most two explicitly
given points. This generalises a result on the independence number of random
graphs. For both the upper and lower bounds, we rely on large deviations
inequalities for the binomial distribution.Comment: 15 page
Invasion percolation on the Poisson-weighted infinite tree
We study invasion percolation on Aldous' Poisson-weighted infinite tree, and
derive two distinct Markovian representations of the resulting process. One of
these is the limit of a representation discovered by Angel et
al. [Ann. Appl. Probab. 36 (2008) 420-466]. We also introduce an exploration
process of a randomly weighted Poisson incipient infinite cluster. The dynamics
of the new process are much more straightforward to describe than those of
invasion percolation, but it turns out that the two processes have extremely
similar behavior. Finally, we introduce two new "stationary" representations of
the Poisson incipient infinite cluster as random graphs on which
are, in particular, factors of a homogeneous Poisson point process on the upper
half-plane .Comment: Published in at http://dx.doi.org/10.1214/11-AAP761 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Every plane graph of maximum degree 8 has an edge-face 9-colouring
An edge-face colouring of a plane graph with edge set and face set is
a colouring of the elements of such that adjacent or incident
elements receive different colours. Borodin proved that every plane graph of
maximum degree can be edge-face coloured with colours.
Borodin's bound was recently extended to the case where . In this
paper, we extend it to the case .Comment: 29 pages, 1 figure; v2 corrects a contraction error in v1; to appear
in SIDM
The t-improper chromatic number of random graphs
We consider the -improper chromatic number of the Erd{\H o}s-R{\'e}nyi
random graph . The t-improper chromatic number of is
the smallest number of colours needed in a colouring of the vertices in which
each colour class induces a subgraph of maximum degree at most . If ,
then this is the usual notion of proper colouring. When the edge probability
is constant, we provide a detailed description of the asymptotic behaviour
of over the range of choices for the growth of .Comment: 12 page
- …