Rainbow matchings in properly-colored hypergraphs

MaRDI QIDQ668047zbMATH OpenFDO

Authors Hao Huang, Tong Li, Guanghui Wang

Publication date 5 March 2019

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.04954, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p4

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Erdős matching conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal set theory (05D05)

Abstract: A hypergraph $H$ is properly colored if for every vertex $vinV(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 $ngeq3k^{2}s$, and $e(H_i)>nchoosek-n-s+1choosek$, then there exists a rainbow matching of size $s$, containing one edge from each $H_i$. This generalizes some previous results on the ErdH{o}s Matching Conjecture.

Recommendations

• Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
• A survey on rainbow matchings in graphs and hypergraphs
• Multicolored matchings in hypergraphs
• Rainbow matchings in properly colored multigraphs
• Full rainbow matchings in graphs and hypergraphs

Cites work

• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Improved bounds for Erdős' matching conjecture
• On Erdős' extremal problem on matchings in hypergraphs
• On matchings in hypergraphs
• On maximal paths and circuits of graphs
• On the maximum number of edges in a hypergraph with given matching number
• On the maximum number of edges in a triple system not containing a disjoint family of a given size
• On the size of graphs with complete-factors
• Rainbow Turán Problems
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• The Erdős matching conjecture and concentration inequalities
• The size of a hypergraph and its matching number

Cited in

(19)

• Anti-Ramsey number of matchings in hypergraphs
• A survey on rainbow matchings in graphs and hypergraphs
• How many colors guarantee a rainbow matching?
• Multicolored matchings in hypergraphs
• Simple juntas for shifted families
• Matchings with few colors in colored complete graphs and hypergraphs
• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• Rainbow spanning structures in graph and hypergraph systems
• Rainbow perfect matchings for 4-uniform hypergraphs
• Full rainbow matchings in graphs and hypergraphs
• Rainbow matchings for 3-uniform hypergraphs
• Existence of rainbow matchings in properly edge-colored graphs
• Rainbow matchings of size m in graphs with total color degree at least 2mn
• Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
• Rainbow matchings and transversals
• Cooperative conditions for the existence of rainbow matchings
• On Rainbow Matchings for Hypergraphs
• The maximum number of cliques in hypergraphs without large matchings
• Rainbow matchings in bipartite multigraphs

This page was built for publication: Rainbow matchings in properly-colored hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668047)