We show that if a multigraph $G$ with maximum edge-multiplicity of at most $\frac{\sqrt{n}}{\log^2 n}$, is edge-coloured by $n$ colours such that each colour class is a disjoint union of cliques with at least $2n + o(n)$ vertices, then it has a full rainbow matching, that is, a matching where each colour appears exactly once. This asymptotically solves a question raised by Clemens, Ehrenmüller and Pokrovskiy, and is related to problems on algebras of sets studied by Grinblat in [Grinblat 2002].
A graph $G$ whose edges are coloured (not necessarily properly) contains a full rainbow matching if there is a matching $M$ that contains exactly one edge of each colour. We refute several conjectures on matchings in hypergraphs and full rainbow matchings in graphs, made by Aharoni and Berger and others.
A conjecture by Aharoni and Berger states that every family of $n$ matchings of size $n+1$ in a bipartite multigraph contains a rainbow matching of size $n$. In this paper we prove that matching sizes of $(3/2 + o(1)) n$ suffice to guarantee such a rainbow matching, which is asymptotically the same bound as the best known one in case we only aim to find a rainbow matching of size $n-1$. This improves previous results by Aharoni, Charbit and Howard, and Kotlar and Ziv.
A rainbow matching in an edge-coloured graph is a matching such that its edges have distinct colours. We show that every properly edge-coloured graph $G$ with $|G| \ge (9δ(G) -5)/2$ has a rainbow matching of size $δ(G)$, improving a result of Diemunsch et al.
A conjecture of the first two authors is that $n$ matchings of size $n$ in any graph have a rainbow matching of size $n-1$. We prove a lower bound of $\frac{2}{3}n-1$, improving on the trivial $\frac{1}{2}n$, and an analogous result for hypergraphs. For $\{C_3,C_5\}$-free graphs and for disjoint matchings we obtain a lower bound of $\frac{3n}{4}-O(1)$. We also discuss a conjecture on rainbow alternating paths, that if true would yield a lower bound of $n-\sqrt{2n}$. We prove the non-alternating (ordinary paths) version of this conjecture.
Let $G$ be an edge-coloured graph. A rainbow subgraph in $G$ is a subgraph such that its edges have distinct colours. The minimum colour degree $δ^c(G)$ of $G$ is the smallest number of distinct colours on the edges incident with a vertex of $G$. We show that every edge-coloured graph $G$ on $n\geq 7k/2+2$ vertices with $δ^c(G) \geq k$ contains a rainbow matching of size at least $k$, which improves the previous result for $k \ge 10$. Let $Δ_{\text{mon}}(G)$ be the maximum number of edges of the same colour incident with a vertex of $G$. We also prove that if $t \ge 11$ and $Δ_{\text{mon}}(G) …
We show the existence of rainbow perfect matchings in $μn$-bounded edge colourings of Dirac bipartite graphs, for a sufficiently small $μ>0$. As an application of our results, we obtain several results on the existence of rainbow $k$-factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree.
By a theorem of Drisko, any $2n-1$ matchings of size $n$ in a bipartite graph have a partial rainbow matching of size $n$. Inspired by discussion of Barát, Gyárfás and Sárközy, we conjecture that if $n$ is odd then the same is true also in general graphs, and that if $n$ is even then $2n$ matchings of size $n$ suffice. We prove that any $3n-2$ matchings of size $n$ have a partial rainbow matching of size $n$.
A {\it rainbow matching} in an edge-colored graph is a matching in which all the edges have distinct colors. Wang asked if there is a function f(δ) such that a properly edge-colored graph G with minimum degree δand order at least f(δ) must have a rainbow matching of size δ. We answer this question in the affirmative; f(δ) = 6.5δsuffices. Furthermore, the proof provides a O(δ(G)|V(G)|^2)-time algorithm that generates such a matching.
A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex $v$ is the number of different colors on edges incident to $v$. We show that if $n$ is large enough (namely, $n\geq 4.25k^2$), then each $n$-vertex graph $G$ with minimum color degree at least $k$ contains a rainbow matching of size at least $k$.
A rainbow matching in an edge-colored graph is a matching in which no two edges have the same color. The color degree of a vertex v is the number of different colors on edges incident to v. Kritschgau [Electron. J. Combin. 27(2020)] studied the existence of rainbow matchings in edge-colored graph G with average color degree at least 2k, and proved some sufficient conditions for a rainbow marching of size k in G. The sufficient conditions include that |V(G)|>=12k^2+4k, or G is a properly edge-colored graph with |V(G)|>=8k. In this paper, we show that every edge-colored graph G with |V(G)|>=4k-4…
Let $g(n)$ be the least number such that every collection of $n$ matchings, each of size at least $g(n)$, in a bipartite graph, has a full rainbow matching. Aharoni and Berger \cite{AhBer} conjectured that $g(n)=n+1$ for every $n>1$. This generalizes famous conjectures of Ryser, Brualdi and Stein. Recently, Aharoni, Charbit and Howard \cite{ACH} proved that $g(n)\le\lfloor\frac{7}{4}n\rfloor$. We prove that $g(n)\le\lfloor\frac{5}{3} n\rfloor$.
Suppose that $k$ is a non-negative integer and a bipartite multigraph $G$ is the union of $$N=\left\lfloor \frac{k+2}{k+1}n\right\rfloor -(k+1)$$ matchings $M_1,\dots,M_N$, each of size $n$. We show that $G$ has a rainbow matching of size $n-k$, i.e. a matching of size $n-k$ with all edges coming from different $M_i$'s. Several choices of parameters relate to known results and conjectures.
Aharoni and Berger conjectured that every bipartite graph which is the union of n matchings of size n + 1 contains a rainbow matching of size n. This conjecture is a generalization of several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. There have been many recent partial results about the Aharoni-Berger Conjecture. In the case when the matchings are much larger than n + 1, the best bound is currently due to Clemens and Ehrenmüller who proved the conjecture when the matchings are of size at least 3n/2 + o(n). When the matchings are all edge-disjoint and per…
Given a coloring of the edges of a multi-hypergraph, a rainbow t-matching is a collection of t disjoint edges, each having a different color. In this note we study the problem of finding a rainbow $t$-matching in an r-partite r-uniform multi-hypergraph whose edges are colored with f colors such that every color class is a matching of size t. This problem was posed by Aharoni and Berger, who asked to determine the minimum number of colors which guarantees a rainbow matching. We improve on the known upper bounds for this problem for all values of the parameters. In particular for every fixed r, …
Drisko proved that $2n-1$ matchings of size $n$ in a bipartite graph have a rainbow matching of size $n$. For general graphs it is conjectured that $2n$ matchings suffice for this purpose (and that $2n-1$ matchings suffice when $n$ is even). The known graphs showing sharpness of this conjecture for $n$ even are called badges. We improve the previously best known bound from $3n-2$ to $3n-3$, using a new line of proof that involves analysis of the appearance of badges. We also prove a "cooperative" generalization: for $t>0$ and $n \geq 3$, any $3n-4+t$ sets of edges, the union of every $t$ of wh…
The existence of a rainbow matching given a minimum color degree, proper coloring, or triangle-free host graph has been studied extensively. This paper, generalizes these problems to edge colored graphs with given total color degree. In particular, we find that if a graph $G$ has total color degree $2mn$ and satisfies some other properties, then $G$ contains a matching of size $m$; These other properties include $G$ being triangle-free, $C_4$-free, properly colored, or large enough.
A hypergraph $H$ is properly colored if for every vertex $v\in V(H)$, all the edges incident to $v$ have distinct colors. In this paper, we show that if $H_{1}$, \cdots, $H_{s}$ are properly-colored $k$-uniform hypergraphs on $n$ vertices, where $n\geq3k^{2}s$, and $e(H_{i})>{{n}\choose {k}}-{{n-s+1}\choose {k}}$, then there exists a rainbow matching of size $s$, containing one edge from each $H_i$. This generalizes some previous results on the Erdős Matching Conjecture.
A rainbow subgraph in an edge-coloured graph is a subgraph such that its edges have distinct colours. The minimum colour degree of a graph is the smallest number of distinct colours on the edges incident with a vertex over all vertices. Kostochka, Pfender, and Yancey showed that every edge-coloured graph on $n$ vertices with minimum colour degree at least $k$ contains a rainbow matching of size at least $k$, provided $n\geq (17/4)k^2$. In this paper, we show that $n\geq 4k-4$ is sufficient for $k \ge 4$.
Kühn, Osthus, and Treglown and, independently, Khan proved that if $H$ is a $3$-uniform hypergraph with $n$ vertices such that $n\in 3\mathbb{Z}$ and large, and $δ_1(H)>{n-1\choose 2}-{2n/3\choose 2}$, then $H$ contains a perfect matching. In this paper, we show that for $n\in 3\mathbb{Z}$ sufficiently large, if $F_1, \ldots, F_{n/3}$ are 3-uniform hypergrapghs with a common vertex set and $δ_1(F_i)>{n-1\choose 2}-{2n/3\choose 2}$ for $i\in [n/3]$, then $\{F_1,\dots, F_{n/3}\}$ admits a rainbow matching, i.e., a matching consisting of one edge from each $F_i$. This is done by converting the ra…
Given a graph $G$ and a subgraph $H$ of $G$, let $rb(G,H)$ be the minimum number $r$ for which any edge-coloring of $G$ with $r$ colors has a rainbow subgraph $H$. The number $rb(G,H)$ is called the rainbow number of $H$ with respect to $G$. Denote $mK_2$ a matching of size $m$ and $B_{n,k}$ a $k$-regular bipartite graph with bipartition $(X,Y)$ such that $|X|=|Y|=n$ and $k\leq n$. In this paper we give an upper and lower bound for $rb(B_{n,k},mK_2)$, and show that for given $k$ and $m$, if $n$ is large enough, $rb(B_{n,k},mK_2)$ can reach the lower bound. We also determine the rainbow number …
In this paper we consider properly edge-colored graphs, i.e. two edges with the same color cannot share an endpoint, so each color class is a matching. A matching is called \it rainbow \rm if its edges have different colors. The minimum degree of a graph is denoted by $δ(G)$. We show that properly edge colored graphs $G$ with $|V(G)|\ge 4δ(G)-3$ have rainbow matchings of size $δ(G)$, this gives the best known estimate to a recent question of Wang. Since one obviously needs at least $2δ(G)$ vertices to guarantee a rainbow matching of size $δ(G)$, we investigate what happens when $|V(G)|\ge 2δ(G…
Let $n$ be a sufficiently large integer with $n\equiv 0\pmod 4$ and let $F_i \subseteq{[n]\choose 4}$ where $i\in [n/4]$. We show that if each vertex of $F_i$ is contained in more than ${n-1\choose 3}-{3n/4\choose 3}$ edges, then $\{F_1, \ldots ,F_{n/4}\}$ admits a rainbow matching, i.e., a set of $n/4$ edges consisting of one edge from each $F_i$. This generalizes a deep result of Khan on perfect matchings in 4-uniform hypergraphs.
Let $k>1$, and let $\mathcal{F}$ be a family of $2n+k-3$ non-empty sets of edges in a bipartite graph. If the union of every $k$ members of $\mathcal{F}$ contains a matching of size $n$, then there exists an $\mathcal{F}$-rainbow matching of size $n$. Replacing $2n+k-3$ by $2n+k-2$, the result is true also for $k=1$, and it can be proved (for all $k$) both topologically and by a relatively simple combinatorial argument. The main effort is in gaining the last $1$, which makes the result sharp.
Let $G$ be a simple graph that is properly edge coloured with $m$ colours and let $\M=\{M_1,\ldots, M_m\}$ be the set of $m$ matchings induced by the colours in $G$. Suppose that $m\le n-n^{c}$, where $c>9/10$, and every matching in $\M$ has size $n$. Then $G$ contains a full rainbow matching, i.e.\ a matching that contains exactly one edge from $M_i$ for each $1\le i\le m$. This answers an open problem of Pokrovskiy and gives an affirmative answer to a generalisation of a special case of a conjecture of Aharoni and Berger. Related results are also found for multigraphs with edges of bounded m…
For a given graph $H$ and $n\geq 1$, let $f(n,H)$ denote the maximum number $c$ for which there is a way to color the edges of the complete graph $K_n$ with $c$ colors such that every subgraph $H$ of $K_n$ has at least two edges of the same color. Equivalently, any edge-coloring of $K_n$ with at least $rb(n,H)=f(n,H)+1$ colors contains a rainbow copy of $H$, where a rainbow subgraph of an edge-colored graph is such that no two edges of it have the same color. The number $rb(n,H)$ is called the {\it rainbow number of $H$}. Erdős, Simonovits and Sós showed that $rb(n,K_3)=n$. In 2004, Schiermeye…
Many well-known problems in Combinatorics can be reduced to finding a large rainbow structure in a certain edge-coloured multigraph. Two celebrated examples of this are Ringel's tree packing conjecture and Ryser's conjecture on transversals in Latin squares. In this paper, we answer such a question raised by Grinblat twenty years ago. Let an $(n,v)$-multigraph be an $n$-edge-coloured multigraph in which the edges of each colour span a disjoint union of non-trivial cliques that have in total at least $v$ vertices. Grinblat conjectured that for all $n \geq 4$, every $(n,3n-2)$-multigraph contain…
Let $k$ and $n$ be two integers, with $k\geq 3$, $n\equiv 0\pmod k$, and $n$ sufficiently large. We determine the $(k-1)$-degree threshold for the existence of a rainbow perfect matchings in $n$-vertex $k$-uniform hypergraph. This implies the result of Rödl, Ruciński, and Szemerédi on the $(k-1)$-degree threshold for the existence of perfect matchings in $n$-vertex $k$-uniform hypergraphs. In our proof, we identify the extremal configurations of closeness, and consider whether or not the hypergraph is close to the extremal configuration. In addition, we also develop a novel absorbing device an…
Let $HP_{n,m,k}$ be drawn uniformly from all $k$-uniform, $k$-partite hypergraphs where each part of the partition is a disjoint copy of $[n]$. We let $HP^{(\k)}_{n,m,k}$ be an edge colored version, where we color each edge randomly from one of $\k$ colors. We show that if $\k=n$ and $m=Kn\log n$ where $K$ is sufficiently large then w.h.p. there is a rainbow colored perfect matching. I.e. a perfect matching in which every edge has a different color. We also show that if $n$ is even and $m=Kn\log n$ where $K$ is sufficiently large then w.h.p. there is a rainbow colored Hamilton cycle in $G^{(n)…
Aharoni and Howard, and, independently, Huang, Loh, and Sudakov proposed the following rainbow version of Erdős matching conjecture: For positive integers $n,k,m$ with $n\ge km$, if each of the families $F_1,\ldots, F_m\subseteq {[n]\choose k}$ has size more than $\max\{\binom{n}{k} - \binom{n-m+1}{k}, \binom{km-1}{k}\}$, then there exist pairwise disjoint subsets $e_1,\dots, e_m$ such that $e_i\in F_i$ for all $i\in [m]$. We prove that there exists an absolute constant $n_0$ such that this rainbow version holds for $k=3$ and $n\geq n_0$. We convert this rainbow matching problem to a matching …
We prove that any family $E_1, \ldots , E_{\lceil rn \rceil}$ of (not necessarily distinct) sets of edges in an $r$-uniform hypergraph, each having a fractional matching of size $n$, has a rainbow fractional matching of size $n$ (that is, a set of edges from distinct $E_i$'s which supports such a fractional matching). When the hypergraph is $r$-partite and $n$ is an integer, the number of sets needed goes down from $rn$ to $rn-r+1$. The problem solved here is a fractional version of the corresponding problem about rainbow matchings, which was solved by Drisko and by Aharoni and Berger in the c…
Given two graphs $G$ and $H$, the {\it rainbow number} $rb(G,H)$ for $H$ with respect to $G$ is defined as the minimum number $k$ such that any $k$-edge-coloring of $G$ contains a rainbow $H$, i.e., a copy of $H$, all of its edges have different colors. Denote by $M_t$ a matching of size $t$ and $\mathcal {T}_n$ the class of all plane triangulations of order $n$, respectively. Jendrol', Schiermeyer and Tu initiated to investigate the rainbow numbers for matchings in plane triangulations, and proved some bounds for the value of $rb({\mathcal {T}_n},M_t)$. Chen, Lan and Song proved that $2n+3t-1…
Given two graphs $G$ and $H$, let $f(G,H)$ denote the maximum number $c$ for which there is a way to color the edges of $G$ with $c$ colors such that every subgraph $H$ of $G$ has at least two edges of the same color. Equivalently, any edge-coloring of $G$ with at least $rb(G,H)=f(G,H)+1$ colors contains a rainbow copy of $H$, where a rainbow subgraph of an edge-colored graph is such that no two edges of it have the same color. The number $rb(G,H)$ is called the {\it rainbow number of $H$ with respect to $G$}, and simply called the {\it bipartite rainbow number of $H$} if $G$ is the complete b…
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 $n/2$ 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 leas…
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back more than two hundred years to the work of Euler on Latin squares and has been the focus of extensive research ever since. Euler posed a problem equivalent to finding properly $n$-edge-coloured complete bipartite graphs $K_{n,n}$ which can be decomposed into rainbow perfect matchings. While there are proper edge-colourings of $K_{n,n}$ without even a single rainbow perfect matching, the theme of this paper is to show that with some very weak additional constra…
Let $n,m$ be integers such that $1\leq m\leq (n-2)/2$ and let $[n]=\{1,\ldots,n\}$. Let $\mathcal{G}=\{G_1,\ldots,G_{m+1}\}$ be a family of graphs on the same vertex set $[n]$. In this paper, we prove that if for any $i\in [m+1]$, the spectral radius of $G_i$ is not less than $\max\{2m,\frac{1}{2}(m-1+\sqrt{(m-1)^2+4m(n-m)})\}$, then $\mathcal{G}$ admits a rainbow matching, i.e. a choice of disjoint edges $e_i\in G_i$, unless $G_1=G_2=\ldots=G_{m+1}$ and $G_1\in \{K_{2m+1}\cup (n-2m-1)K_1, K_m\vee (n-m)K_1\}$.
Given two graphs $G$ and $H$, the {\it rainbow number} $rb(G,H)$ for $H$ with respect to $G$ is defined as the minimum number $k$ such that any $k$-edge-coloring of $G$ contains a rainbow $H$, i.e., a copy of $H$, all of whose edges have different colors. Denote by $kK_2$ a matching of size $k$ and $\mathcal {T}_n$ the class of all plane triangulations of order $n$, respectively. In [S. Jendrol$'$, I. Schiermeyer and J. Tu, Rainbow numbers for matchings in plane triangulations, Discrete Math. 331(2014), 158--164], the authors determined the exact values of $rb(\mathcal {T}_n, kK_2)$ for $2\leq…
We say that the families $\mathcal F_1,\ldots, \mathcal F_{s+1}$ of $k$-element subsets of $[n]$ are cross-dependent if there are no pairwise disjoint sets $F_1,\ldots, F_{s+1}$, where $F_i\in \mathcal F_i$ for each $i$. The rainbow version of the Erd\H os Matching Conjecture due to Aharoni and Howard and independently to Huang, Loh and Sudakov states that $\min_{i} |\mathcal F_i|\le \max\big\{{n\choose k}-{n-s\choose k}, {(s+1)k-1\choose k}\big\}$ for $n\ge (s+1)k$. In this paper, we prove this conjecture for $n>3e(s+1)k$ and $s>10^7$. One of the main tools in the proof is a concentration ine…
In this paper, we prove a conjecture of Aharoni and Howard on the existence of rainbow (transversal) matchings in sufficiently large families $\mathcal F_1,\ldots, \mathcal F_s$ of tuples in $\{1,\ldots, n\}^k$, provided $s\ge 470.$
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back to the work of Euler on Latin squares and has been the focus of extensive research ever since. Many conjectures in this area roughly say that 'every edge coloured graph of a certain type contains a rainbow matching using every colour'. In this paper we introduce a versatile 'sampling trick', which allows us to obtain short proofs of old results as well as to solve asymptotically some well known conjectures. - We give a simple proof of Pokrovskiy's asymptotic v…
Aharoni and Howard conjectured that, for positive integers $n,k,t$ with $n\ge k$ and $n\ge t$, if $F_1,\ldots, F_t\subseteq {[n]\choose k}$ such that $|F_i|>{n\choose k}-{n-t+1\choose k}$ for $i\in [t]$ then there exist $e_i\in F_i$ for $i\in [t]$ such that $e_1,\ldots,e_t$ are pairwise disjoint. Huang, Loh, and Sudakov proved this conjecture for $t<n/(3k^2)$. In this paper, we show that this conjecture holds for $t\le n/(2k)$ and $n$ sufficiently large.
A d-partite hypergraph is called *fractionally balanced* if there exists a non-negative, not identically zero, function on its edge set that has constant degrees in each vertex side. Using a topological version of Hall's theorem we prove lower bounds on the matching number of such hypergraphs. These bounds yield rainbow versions of the KKM theorem for products of simplices, which in turn are used to obtain some results on multiple-cake division, and on rainbow matchings in families of d-intervals.
Given an edge-colored complete graph $K_n$ on $n$ vertices, a perfect (respectively, near-perfect) matching $M$ in $K_n$ 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 $K_n$ by circular distance, and we denote the resulting complete graph by $K^{\bullet}_n$. We show that when $K^{\bullet}_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…
A perfect matching M in an edge-colored complete bipartite graph K_{n,n} is rainbow if no pair of edges in M have the same color. We obtain asymptotic enumeration results for the number of rainbow matchings in terms of the maximum number of occurrences of a color. We also consider two natural models of random edge-colored K_{n,n} and show that, if the number of colors is at least n, then there is with high probability a random matching. This in particular shows that almost every square matrix of order n in which every entry appears at most n times has a Latin transversal.
Let $n_1,\dots,n_\ell,k_1,\dots,k_\ell$ be integers and let $V_1,\dots,V_\ell$ be disjoint sets with $|V_i|=n_i$ for $i=1,\dots,\ell$. Define $\sqcup_{i=1}^\ell \binom{V_i}{k_i}$ as the collection of all subsets $F$ of $\cup_{i=1}^\ell V_i$ with $|F\cap V_i| =k_i$ for each $i=1,\dots,\ell$. In this paper, we show that if the matching number of $\mathcal{F}\subseteq \sqcup_{i=1}^\ell \binom{V_i}{k_i}$ is at most $s$ and $n_i\geq 4\ell^2 k_i^2s$ for all $i$, then $|\mathcal{F}| \leq \max_{1\leq i\leq \ell}[\binom{n_i}{k_i}-\binom{n_i-s}{k_i}]\prod_{j\neq i}\binom{n_j}{k_j}$. Let $\mathcal{F}_1,\…
Drisko \cite{drisko} proved (essentially) that every family of $2n-1$ matchings of size $n$ in a bipartite graph possesses a partial rainbow matching of size $n$. In \cite{bgs} this was generalized as follows: Any $\lfloor \frac{k+2}{k+1} n \rfloor -(k+1)$ matchings of size $n$ in a bipartite graph have a rainbow matching of size $n-k$. We extend this latter result to matchings of not necessarily equal cardinalities. Settling a conjecture of Drisko, we characterize those families of $2n-2$ matchings of size $n$ in a bipartite graph that do not possess a rainbow matching of size $n$. Combining …
Stein proposed the following conjecture: if the edge set of $K_{n,n}$ is partitioned into $n$ sets, each of size $n$, then there is a partial rainbow matching of size $n-1$. He proved that there is a partial rainbow matching of size $n(1-\frac{D_n}{n!})$, where $D_n$ is the number of derangements of $[n]$. This means that there is a partial rainbow matching of size about $(1- \frac{1}{e})n$. Using a topological version of Hall's theorem we improve this bound to $\frac{2}{3}n$.
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-coloured by $n$ colours with at least $n + 1$ edges of each colour there must be a matching that uses each colour exactly once. In this paper we consider the same question without the bipartiteness assumption. We show that in any multigraph with edge multiplicities $o(n)$ that is properly edge-coloured by $n$ colours with at least $n + o(n)$ edges of each colour there must be a matching of size $n-O(1)$ that uses each colour at most once.
For any posotive integer $m$, let $[m]:=\{1,\ldots,m\}$. Let $n,k,t$ be positive integers. Aharoni and Howard conjectured that if, for $i\in [t]$, $\mathcal{F}_i\subset[n]^k:= \{(a_1,\ldots,a_k): a_j\in [n] \mbox{ for } j\in [k]\}$ and $|\mathcal{F}_i|>(t-1)n^{k-1}$, then there exist $M\subseteq [n]^k$ such that $|M|=t$ and $|M\cap \mathcal{F}_i|=1$ for $i\in [t]$ We show that this conjecture holds when $n\geq 3(k-1)(t-1)$. Let $n, t, k_1\ge k_2\geq \ldots\geq k_t $ be positive integers. Huang, Loh and Sudakov asked for the maximum $Π_{i=1}^t |{\cal R}_i|$ over all ${\cal R}=\{{\cal R}_1, \ldo…
