Is it true that if G is an n-vertex graph with at least 1 Ω(n2− r ) edges then it contains an r-blow-up of a subdivision of Km ?
Statement
Is it true that if G is an n-vertex graph with at least 1 Ω(n2− r ) edges then it contains an r-blow-up of a subdivision of Km ? Question 6. Fix m ⩾ 2. What is the smallest c such that for all sufficiently large n the following holds: if G is a properly edge-coloured graph on n vertices with at least Ω(n(log n)c ) edges, then it contains a rainbow subdivision of Km ? In particular, is c = 1? 1 60 From our results it also follows that any n-vertex graph with at least n2− r (log n) r edges contains an r-blow-up of a subdivision of Km . This bound is tight up to 60 (log n) r factor, due to the following proposition, which was mentioned in [4] as a remark. We pose the following question, which strengthens Question 6.2 in [4].
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.