6 research outputs found
Rainbow perfect matchings in r-partite graph structures
A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite multigraphs, dense regular bipartite graphs and complete r-partite r-uniform hypergraphs. The proof of the results use the Lopsided version of the Local Lovász Lemma.Peer ReviewedPostprint (author's final draft
Flattening rank and its combinatorial applications
Given a -dimensional tensor (where is a field), the -flattening rank of is
the rank of the matrix whose rows are indexed by , columns are indexed
by
and whose entries are given by the corresponding values of . The
max-flattening rank of is defined as . A tensor is called
semi-diagonal, if for every , and
for every that are all
distinct. In this paper we prove that if is
semi-diagonal, then , and this bound is
the best possible.
We give several applications of this result, including a generalization of
the celebrated Frankl-Wilson theorem on forbidden intersections. Also,
addressing a conjecture of Aharoni and Berger, we show that if the edges of an
-uniform multi-hypergraph are colored with colors such
that each colorclass is a matching of size , then contains a
rainbow matching of size provided . This improves
previous results of Alon and Glebov, Sudakov and Szab\'o
Rainbow matchings in hypergraphs
A rainbow matching in an edge colored multihypergraph is a matching consisting of edges with pairwise distinct colors. In this master thesis we give an overview of the results about having a rainbow matching in edge-colored bipartite graphs and edge colored r-partite r-uniform hypergraphs. Having in mind the techniques that are used in the last results we aplied them and we get some new approaches using the Local Lovasz Lemma
How Many Colors Guarantee a Rainbow Matching?
ISSN:1097-1440ISSN:1077-892