Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
From MaRDI portal
Publication:4446871
DOI10.1002/rsa.10102zbMath1037.05033OpenAlexW2098884097WikidataQ105583284 ScholiaQ105583284MaRDI QIDQ4446871
Noga Alon, Dan Pritikin, Zevi Miller, Tao Jiang
Publication date: 3 February 2004
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10102
Related Items (36)
Maximum cliques in graphs with small intersection number and random intersection graphs ⋮ Properly coloured copies and rainbow copies of large graphs with small maximum degree ⋮ Large Rainbow Cliques in Randomly Perturbed Dense Graphs ⋮ Multicolor Turán numbers ⋮ On degree anti-Ramsey numbers ⋮ Bounded colorings of multipartite graphs and hypergraphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Bounds for bipartite rainbow Ramsey numbers ⋮ On the approximability of the minimum rainbow subgraph problem and other related problems ⋮ Graph Tilings in Incompatibility Systems ⋮ Rainbow tetrahedra in Cayley graphs ⋮ On an anti-Ramsey threshold for random graphs ⋮ How many colors guarantee a rainbow matching? ⋮ Balanced edge-colorings avoiding rainbow cliques of size four ⋮ Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza ⋮ Sparse hypergraphs with low independence number ⋮ Extremal Results for Berge Hypergraphs ⋮ Color degree and heterochromatic cycles in edge-colored graphs ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ Rainbow Hamiltonian cycles in strongly edge-colored graphs ⋮ Properly edge-coloured subgraphs in colourings of bounded degree ⋮ Almost-Fisher families ⋮ Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting ⋮ Rainbow Matchings: existence and counting ⋮ Better lower and upper bounds for the minimum rainbow subgraph problem ⋮ Large cliques in sparse random intersection graphs ⋮ Rainbow decompositions ⋮ Some rainbow cycles in \(r\)-good edge-colorings ⋮ Anti-Ramsey theory on complete bipartite graphs ⋮ Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Constrained Ramsey Numbers ⋮ Constrained Ramsey Numbers ⋮ Rainbow faces in edge‐colored plane graphs ⋮ Canonical Ramsey numbers and properly colored cycles ⋮ Distinct Volume Subsets
This page was built for publication: Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
