2 problems

0 votes0 replies0 views
Bijumbled graphs without cliques at the conjectured exponent
For a graph with edge-density parameter $p$ , call it $(p,\nu)$ -bijumbled if it satisfies the relevant bijumbledness condition with parameter $\nu$ . Bijumbled clique-avoidance conje…
Conjecturesolvedbijumbled-graphs cliques pseudorandom-graphsarXiv posted 2 days ago
0 votes0 replies1 view
Optimal bijumbledness for the partial system of representatives lemma
Bijumbledness conjecture. Nevertheless we conjecture that $(p,cp^{\Delta+1}n)$ -bijumbledness suffices.
Conjectureopenbijumbled-graphs blow-up-lemmas sparse-graphsarXiv posted 2 days ago

Bijumbled graphs without cliques at the conjectured exponent