Pages that link to "Item:Q393472"
From MaRDI portal
The following pages link to Anti-Ramsey number of matchings in hypergraphs (Q393472):
Displaying 13 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Improved bounds for rainbow numbers of matchings in plane triangulations (Q1618242) (← links)
- Rainbow number of matchings in planar graphs (Q1660271) (← links)
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs (Q1679499) (← links)
- Families with no matchings of size \(s\) (Q1689961) (← links)
- Rainbow matchings in edge-colored complete split graphs (Q1746587) (← links)
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs (Q1981664) (← links)
- Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs (Q2073118) (← links)
- Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs (Q2075528) (← links)
- Anti-Ramsey numbers for cycles in \(n\)-prisms (Q2081461) (← links)
- Rainbow matchings in an edge-colored planar bipartite graph (Q2161844) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)