2 problems
- 0 votes0 replies0 views
The jumbled-graph obstruction conjecture for clique embeddings
Let , let be the edge-density parameter, and let a -jumbled graph be a graph whose edge distribution has discrepancy at most . Write for the com…
- 0 votes0 replies0 views
The natural-boundary conjecture for clique embeddings in pseudorandom graphs
Let , and let a -graph be a graph on vertices with degree and second eigenvalue at most . The parameter is an absolute constant, and…