Pages that link to "Item:Q668047"
From MaRDI portal
The following pages link to Rainbow matchings in properly-colored hypergraphs (Q668047):
Displaying 18 items.
- Anti-Ramsey number of matchings in hypergraphs (Q393472) (← links)
- How many colors guarantee a rainbow matching? (Q405108) (← links)
- Multicolored matchings in hypergraphs (Q446272) (← links)
- Rainbow matchings in bipartite multigraphs (Q524181) (← links)
- Rainbow matchings of size \(m\) in graphs with total color degree at least \(2mn\) (Q783076) (← links)
- A rainbow \(k\)-matching in the complete graph with \(r\) colors (Q1028829) (← links)
- Existence of rainbow matchings in properly edge-colored graphs (Q1758120) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- Cooperative conditions for the existence of rainbow matchings (Q2073319) (← links)
- The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Rainbow matchings and transversals (Q2876039) (← links)
- A survey on rainbow matchings in graphs and hypergraphs (Q3307338) (← links)
- On Rainbow Matchings for Hypergraphs (Q4602861) (← links)
- Simple juntas for shifted families (Q5126777) (← links)
- Full rainbow matchings in graphs and hypergraphs (Q5886109) (← links)
- Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs (Q6098072) (← links)