Rainbow Turán Problems
From MaRDI portal
Publication:3429743
DOI10.1017/S0963548306007760zbMath1119.05058WikidataQ105583870 ScholiaQ105583870MaRDI QIDQ3429743
Jacques Verstraete, Dhruv Mubayi, Peter Keevash, Benjamin Sudakov
Publication date: 20 March 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques, Large Rainbow Cliques in Randomly Perturbed Dense Graphs, Generalized rainbow Turán problems, Multicolor Turán numbers, A rainbow Erdős-Rothschild problem, The Generalized Rainbow Turán Problem for Cycles, Large rainbow matchings in edge-colored graphs with given average color degree, On odd rainbow cycles in edge-colored graphs, Generalized rainbow Turán numbers of odd cycles, Rainbow spanning structures in graph and hypergraph systems, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph, On an anti-Ramsey threshold for random graphs, How many colors guarantee a rainbow matching?, Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs, A Rainbow Erdös--Rothschild Problem, Rainbow Saturation for Complete Graphs, Balanced edge-colorings avoiding rainbow cliques of size four, Rainbow clique subdivisions, Rainbow cycles vs. rainbow paths, Graphs without a Rainbow Path of Length 3, On the Turán number of the hypercube, Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza, Rainbow subdivisions of cliques, Graph theory. Abstracts from the workshop held January 2--8, 2022, Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles, Extremal Results for Berge Hypergraphs, Rainbow Turán number of clique subdivisions, Unnamed Item, Rainbow Hamiltonian cycles in strongly edge-colored graphs, Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers, Rainbow matchings in properly-colored hypergraphs, On the rainbow Turán number of paths, Rainbow Turán problems for paths and forests of stars, Rainbow decompositions, Minimum rainbow \(H\)-decompositions of graphs, Minimum rainbow \(H\)-decompositions of graphs, Cycles of given lengths in hypergraphs, Some rainbow cycles in \(r\)-good edge-colorings, Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees, Rainbow factors in hypergraphs, Small rainbow cliques in randomly perturbed dense graphs, Rainbow saturation
