Pages that link to "Item:Q4655902"
From MaRDI portal
The following pages link to On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle (Q4655902):
Displayed 36 items.
- Anti-Ramsey numbers in complete split graphs (Q279216) (← links)
- Anti-Ramsey coloring for matchings in complete bipartite graphs (Q512859) (← links)
- Avoiding rainbow 2-connected subgraphs (Q527226) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- The rainbow number of matchings in regular bipartite graphs (Q735110) (← links)
- Rainbow numbers for cycles with pendant edges (Q1014810) (← links)
- Maximum face-constrained coloring of plane graphs (Q1421525) (← links)
- On maximum face-constrained coloring of plane graphs with no short face cycles. (Q1426126) (← links)
- Improved bounds for rainbow numbers of matchings in plane triangulations (Q1618242) (← links)
- Anti-Ramsey number of Hanoi graphs (Q1630944) (← links)
- Some heterochromatic theorems for matroids (Q1660247) (← links)
- Rainbow number of matchings in planar graphs (Q1660271) (← links)
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs (Q1679499) (← links)
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs (Q1732824) (← links)
- Rainbow matchings in edge-colored complete split graphs (Q1746587) (← links)
- Anti-Ramsey numbers of subdivided graphs (Q1850619) (← links)
- Rainbow numbers for matchings and complete graphs (Q1883265) (← links)
- Anti-Ramsey number of triangles in complete multipartite graphs (Q2045396) (← links)
- Anti-Ramsey numbers for vertex-disjoint triangles (Q2092342) (← links)
- Improved approximation for maximum edge colouring problem (Q2161229) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)
- Anti-Ramsey problems for cycles (Q2243332) (← links)
- Rainbow triangles in edge-colored Kneser graphs (Q2284337) (← links)
- Rainbow numbers for small graphs in planar graphs (Q2287674) (← links)
- On rainbow matchings in plane triangulations (Q2329209) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066) (← links)
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set (Q2409524) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees (Q2657096) (← links)
- Exact rainbow numbers for matchings in plane triangulations (Q2659207) (← links)
- Bipartite anti-Ramsey numbers of cycles (Q3156920) (← links)
- Rainbow numbers for certain graphs (Q3439415) (← links)
- Anti-Ramsey numbers for disjoint copies of graphs (Q4690986) (← links)
- Anti-Ramsey numbers for matchings in regular bipartite graphs (Q5347253) (← links)
- (Q5708587) (← links)
- Anti-Ramsey number of matchings in outerplanar graphs (Q6145814) (← links)
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)