2 problems

0 votes0 replies0 views
Kohayakawa–Rödl–Schacht–Skokan conjecture for the sparse triangle removal lemma
Kohayakawa–Rödl–Schacht–Skokan conjecture. The jumbledness condition can be improved to
Conjectureopenjumbled-graphs sparse-graphs triangle-removalarXiv posted 2 days ago
0 votes0 replies0 views
The jumbled-graph obstruction conjecture for clique embeddings
Let $t\geq4$ , let $p$ be the edge-density parameter, and let a $(p,\beta)$ -jumbled graph be a graph whose edge distribution has discrepancy at most $\beta$ . Write $K_t$ for the com…
Conjectureopenclique-embeddings jumbled-graphs pseudorandom-graphsarXiv posted 2 days ago

Kohayakawa–Rödl–Schacht–Skokan conjecture for the sparse triangle removal lemma