scientific article
From MaRDI portal
Publication:4075490
zbMATH Open0316.05111MaRDI QIDQ4075490FDOQ4075490
Miklós Simonovits, P. Erdős, Vera T. Sós
Publication date: 1975
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- Planar anti-Ramsey numbers of matchings
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Anti-Ramsey number of matchings in hypergraphs
- On odd rainbow cycles in edge-colored graphs
- Exactly \(m\)-coloured complete infinite subgraphs
- Rainbow numbers for certain graphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- An anti-Ramsey theorem
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Some heterochromatic theorems for matroids
- $(g,f)$-Chromatic spanning trees and forests
- Complete solution for the rainbow numbers of matchings
- Anti-Ramsey numbers of subdivided graphs
- Anti-Ramsey properties of random graphs
- An explicit construction for a Ramsey problem
- Anti-Ramsey numbers in complete split graphs
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Rainbow numbers for matchings in plane triangulations
- Planar anti-Ramsey numbers of paths and cycles
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- \((k,\lambda)\)-anti-powers and other patterns in words
- Anti-Ramsey number of Hanoi graphs
- Facial rainbow edge-coloring of plane graphs
- Monochromatic subgraphs in the absence of a properly colored 4-cycle
- Anti-powers in infinite words
- The anti-Ramsey number of perfect matching
- Rainbow matchings in an edge-colored planar bipartite graph
- Bipartite rainbow numbers of matchings
- Anti-Ramsey problems for cycles
- On restricted colourings of \(K_ n\)
- An anti-Ramsey Theorem on edge-cutsets
- A note on the monotonicity of mixed Ramsey numbers
- Anti-Ramsey Hypergraph Numbers
- On a generalized anti-Ramsey problem
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Rainbow cliques in edge-colored graphs
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- Title not available (Why is that?)
- Rainbow numbers for matchings and complete graphs
- Title not available (Why is that?)
- More star sub-Ramsey numbers
- Anti-Ramsey numbers of spanning double stars
- Anti-Ramsey Multiplicities
- On Erdős-Rado numbers
- Title not available (Why is that?)
- On a heterochromatic number for hypercubes
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- An anti-Ramsey theorem
- Coloring the cube with rainbow cycles
- Extremal problems concerning transformations of the set of edges of the complete graph
- Approximation and hardness results for the maximum edge \(q\)-coloring problem
- Anti-Ramsey colorings in several rounds
- Size and degree anti-Ramsey numbers
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Complete graphs without polychromatic circuits
- An anti-Ramsey theorem on cycles
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- On the anti-Ramsey numbers of linear forests
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Rainbow-free 3-colorings in abelian groups
- The rainbow number of matchings in regular bipartite graphs
- Rainbow connection and graph products
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- Anti-Ramsey number of matchings in a hypergraph
- On sufficient conditions for rainbow cycles in edge-colored graphs
- A stability result of the Pósa lemma
- Complexity of Computing the Anti-Ramsey Numbers for Paths.
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees
- A large number of \(m\)-coloured complete infinite subgraphs
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- Local rainbow colorings for various graphs
- On the anti-Ramsey number of forests
- Approximating maximum edge 2-coloring by normalizing graphs
- Properly colored \(C_4\)'s in edge-colored graphs
- On the balanced upper chromatic number of cyclic projective planes and projective spaces
- The rainbow numbers of cycles in maximal bipartite planar graph
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs
- Anti-Ramsey numbers in complete \(k\)-partite graphs
- Rainbow triangles and cliques in edge-colored graphs
- Rainbow numbers for paths in planar graphs
- Computing the anti-Ramsey number for trees in complete tripartite graph
- Rainbow numbers for small graphs in planar graphs
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Anti-Ramsey problems in the Mycielskian of a cycle
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
- Totally Multicolored diamonds
- Constrained Ramsey numbers for the loose path, cycle and star
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
- Anti-Ramsey number of triangles in complete multipartite graphs
- Anti-Ramsey numbers for vertex-disjoint triangles
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts
- Anti-van der Waerden numbers on graphs
- Improved approximation for maximum edge colouring problem
- Anti-Ramsey number of disjoint union of star-like hypergraphs
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
- On rainbow matchings in plane triangulations
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4075490)
