61 research outputs found
Rainbow perfect matchings and Hamilton cycles in the random geometric graph
Given a graph on n vertices and an assignment of colours to the edges, a rainbow Hamilton cycle is a cycle of length n visiting each vertex once and with pairwise different colours on the edges. Similarly (for even n) a rainbow perfect matching is a collection of independent edges with pairwise different colours. In this note we show that if we randomly colour the edges of a random geometric graph with sufficiently many colours, then a.a.s. the graph contains a rainbow perfect matching (rainbow Hamilton cycle) if and only if the minimum degree is at least 1 (respectively, at least 2). More precisely, consider n points (i.e. vertices) chosen independently and uniformly at random from the unit d‐dimensional cube for any fixed . Form a sequence of graphs on these n vertices by adding edges one by one between each possible pair of vertices. Edges are added in increasing order of lengths (measured with respect to the norm, for any fixed ). Each time a new edge is added, it receives a random colour chosen uniformly at random and with repetition from a set of colours, where a sufficiently large fixed constant. Then, a.a.s. the first graph in the sequence with minimum degree at least 1 must contain a rainbow perfect matching (for even n), and the first graph with minimum degree at least 2 must contain a rainbow Hamilton cycle
Rainbow Cycles in Flip Graphs
The flip graph of triangulations has as vertices all triangulations of a convex n-gon, and an edge between any two triangulations that differ in exactly one edge. An r-rainbow cycle in this graph is a cycle in which every inner edge of the triangulation appears exactly r times. This notion of a rainbow cycle extends in a natural way to other flip graphs. In this paper we investigate the existence of r-rainbow cycles for three different flip graphs on classes of geometric objects: the aforementioned flip graph of triangulations of a convex n-gon, the flip graph of plane spanning trees on an arbitrary set of n points, and the flip graph of non-crossing perfect matchings on a set of n points in convex position. In addition, we consider two flip graphs on classes of non-geometric objects: the flip graph of permutations of {1,2,...,n } and the flip graph of k-element subsets of {1,2,...,n }. In each of the five settings, we prove the existence and non-existence of rainbow cycles for different values of r, n and k
Rainbow spanning trees in randomly coloured
Given a graph on vertices and an assignment of colours to its
edges, a set of edges is said to be rainbow if edges from
have pairwise different colours assigned to them. In this paper, we investigate
rainbow spanning trees in randomly coloured random graphs.Comment: 17 page
Rainbow Perfect and Near-Perfect Matchings in Complete Graphs with Edges Colored by Circular Distance
Given an edge-colored complete graph Kn on n vertices, a perfect (respectively, near-perfect) matching M in Kn with an even (respectively, odd) number of vertices is rainbow if all edges have distinct colors. In this paper, we consider an edge coloring of Kn by circular distance, and we denote the resulting complete graph by K●n. We show that when K●n has an even number of vertices, it contains a rainbow perfect matching if and only if n=8k or n=8k+2, where k is a nonnegative integer. In the case of an odd number of vertices, Kirkman matching is known to be a rainbow near-perfect matching in K●n. However, real-world applications sometimes require multiple rainbow near-perfect matchings. We propose a method for using a recursive algorithm to generate multiple rainbow near-perfect matchings in K●n
Rainbow cycles in flip graphs
The flip graph of triangulations has as vertices all triangulations of a convex -gon, and an edge between any two triangulations that differ in exactly one edge. An -rainbow cycle in this graph is a cycle in which every inner edge of the triangulation appears exactly ~times. This notion of a rainbow cycle extends in a natural way to other flip graphs. In this paper we investigate the existence of -rainbow cycles for three different flip graphs on classes of geometric objects: the aforementioned flip graph of triangulations of a convex -gon, the flip graph of plane trees on an arbitrary set of ~points, and the flip graph of non-crossing perfect matchings on a set of ~points in convex position. In addition, we consider two flip graphs on classes of non-geometric objects: the flip graph of permutations of and the flip graph of -element subsets of . In each of the five settings, we prove the existence and non-existence of rainbow cycles for different values of~, and~
Rainbow Hamilton Cycles in Random Geometric Graphs
Let be chosen independently and uniformly at random from
the unit -dimensional cube . Let be given and let . The random geometric graph has
vertex set and an edge whenever . We show
that if each edge of is colored independently from one of colors
and has the smallest value such that has minimum degree at least two,
then contains a rainbow Hamilton cycle a.a.s
Among graphs, groups, and latin squares
A latin square of order n is an n × n array in which each row and each column contains each of the numbers {1, 2, . . . , n}. A k-plex in a latin square is a collection of entries which intersects each row and column k times and contains k copies of each symbol. This thesis studies the existence of k-plexes and approximations of k-plexes in latin squares, paying particular attention to latin squares which correspond to multiplication tables of groups. The most commonly studied class of k-plex is the 1-plex, better known as a transversal. Although many latin squares do not have transversals, Brualdi conjectured that every latin square has a near transversal—i.e. a collection of entries with distinct symbols which in- tersects all but one row and all but one column. Our first main result confirms Brualdi’s conjecture in the special case of group-based latin squares. Then, using a well-known equivalence between edge-colorings of complete bipartite graphs and latin squares, we introduce Hamilton 2-plexes. We conjecture that every latin square of order n ≥ 5 has a Hamilton 2-plex and provide a range of evidence for this conjecture. In particular, we confirm our conjecture computationally for n ≤ 8 and show that a suitable analogue of Hamilton 2-plexes always occur in n × n arrays with no symbol appearing more than n/√96 times. To study Hamilton 2-plexes in group-based latin squares, we generalize the notion of harmonious groups to what we call H2-harmonious groups. Our second main result classifies all H2-harmonious abelian groups. The last part of the thesis formalizes an idea which first appeared in a paper of Cameron and Wanless: a (k,l)-plex is a collection of entries which intersects each row and column k times and contains at most l copies of each symbol. We demonstrate the existence of (k, 4k)-plexes in all latin squares and (k, k + 1)-plexes in sufficiently large latin squares. We also find analogues of these theorems for Hamilton 2-plexes, including our third main result: every sufficiently large latin square has a Hamilton (2,3)-plex
Combinatorics, Probability and Computing
One of the exciting phenomena in mathematics in recent years has been the widespread and surprisingly effective use of probabilistic methods in diverse areas. The probabilistic point of view has turned out to b
Hypergraph matchings and designs
We survey some aspects of the perfect matching problem in hypergraphs, with
particular emphasis on structural characterisation of the existence problem in
dense hypergraphs and the existence of designs.Comment: 19 pages, for the 2018 IC
Pseudorandom hypergraph matchings
A celebrated theorem of Pippenger states that any almost regular hypergraph
with small codegrees has an almost perfect matching. We show that one can find
such an almost perfect matching which is `pseudorandom', meaning that, for
instance, the matching contains as many edges from a given set of edges as
predicted by a heuristic argument.Comment: 14 page
- …