Pages that link to "Item:Q3904632"
From MaRDI portal
The following pages link to On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems (Q3904632):
Displayed 50 items.
- Anti-Ramsey numbers in complete split graphs (Q279216) (← links)
- Anti-Ramsey numbers of graphs with small connected components (Q292266) (← links)
- Anti-Ramsey coloring for matchings in complete bipartite graphs (Q512859) (← links)
- Avoiding rainbow 2-connected subgraphs (Q527226) (← links)
- The rainbow number of matchings in regular bipartite graphs (Q735110) (← links)
- Rainbow numbers for cycles with pendant edges (Q1014810) (← links)
- Bipartite rainbow numbers of matchings (Q1025529) (← links)
- Complete solution for the rainbow numbers of matchings (Q1025962) (← links)
- Edge-colorings of complete graphs that avoid polychromatic trees (Q1421517) (← 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)
- 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)
- On Erdős-Rado numbers (Q1842571) (← links)
- Anti-Ramsey numbers of subdivided graphs (Q1850619) (← links)
- Rainbow numbers for matchings and complete graphs (Q1883265) (← links)
- Coloring the cube with rainbow cycles (Q1953479) (← links)
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs (Q1981664) (← links)
- Anti-Ramsey number of triangles in complete multipartite graphs (Q2045396) (← links)
- On the maximal colorings of complete graphs without some small properly colored subgraphs (Q2053693) (← links)
- Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs (Q2075528) (← links)
- Anti-Ramsey numbers for cycles in \(n\)-prisms (Q2081461) (← 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)
- Rainbow numbers for paths in planar graphs (Q2242061) (← 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)
- Planar anti-Ramsey numbers of paths and cycles (Q2324510) (← 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)
- Planar anti-Ramsey numbers of matchings (Q2421877) (← links)
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey (Q2422839) (← links)
- An anti-Ramsey theorem on cycles (Q2573806) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees (Q2657096) (← links)
- On the anti-Ramsey number of forests (Q2659067) (← links)
- Exact rainbow numbers for matchings in plane triangulations (Q2659207) (← 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)
- (Q5708606) (← links)
- Anti-Ramsey number of matchings in outerplanar graphs (Q6145814) (← links)
- Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs (Q6162143) (← links)
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs (Q6183431) (← links)