16 problems
- 0 votes0 replies0 views
The refined threshold conjecture for expanded cliques with bounded matching number
Let be the -uniform expansion of the complete graph on vertices, let be an -uniform matching with edges, and let…
- 0 votes0 replies1 view
The rainbow Turán threshold conjecture for expanded cliques
Let denote the rainbow hyper-Turán number for the -uniform expansion , and let be the number of edges…
- 0 votes0 replies0 views
Yang–Zeng–Zhang's conjecture for expanded cliques with bounded matching number
Let be the -uniform expansion of the complete graph on vertices, let be an -uniform matching with edges, and let…
- 0 votes0 replies1 view
Gerbner–Tompkins–Zhou's asymptotic conjecture for expanded graphs with bounded matching number
Let be a graph with chromatic number , and let be an independent set of such that deleting results in a graph of chromatic number . Su…
- 0 votes0 replies0 views
Mubayi's uniqueness conjecture for expanded complete graphs
Let be the complete balanced -partite -graph, and let be the -uniform expansion of the complete graph on vertices.…
- 0 votes0 replies1 view
Erdős's conjecture on the Turán number of the expanded triangle
Let denote the -uniform expansion of the triangle, and let be its -uniform Turán number. Erdős's expanded-triangle conjecture. Fo…
- 0 votes0 replies0 views
The codegree-squared density conjecture for
The codegree-squared density conjecture for . The lower bound is tight:
- 0 votes0 replies1 view
The lower-bound sharpness conjecture for
The lower-bound sharpness conjecture for . All four lower bounds are sharp:
- 0 votes0 replies0 views
The complement-of-Fano blow-up conjecture for in codegree squared density
Let be the iterated blow-up of the complement of the Fano plane. It is -free and has codegree squared density at least . The complement-of-Fano blow-up conjecture fo…
- 0 votes0 replies0 views
The iterated-blow-up conjecture for
Let be the iterated blow-up of an edge, obtained from a complete balanced -partite -graph by inserting a complete balanced -partite -graph recursively in each part.…
- 0 votes0 replies0 views
The extremal blow-up conjecture for in codegree squared density
Let be the -graph on six vertices with edge set … Let and let be the iterated blow-up of . The -graph is -free and satisfies…
- 0 votes0 replies0 views
The codegree-squared extremal conjecture for the Fano plane
Let be the Fano plane, and let be the complete balanced bipartite -graph on vertices. For a -graph , write for its codegree…
- 0 votes0 replies0 views
The generalized daisy density conjecture
For fixed integers and , let consist of all -sets containing a fixed -set and contained in , where is a fixed disjoint …
- 0 votes0 replies0 views
The exact power-of-seven bound for daisy-free triple systems
Let be a family of -sets of , where , and suppose that contains no daisy. The power-of-seven daisy bound. … This is proposed as the exact u…
- 0 votes0 replies0 views
The 3-daisy density conjecture
Let be the daisy formed from a fixed -set and a disjoint -set, and let be its limiting Turán density. The 3-daisy density conjecture. … The…
- 0 votes0 replies0 views
The daisy density conjecture
Let . For a set , write for its -subsets. An -graph is a subset of . Given an -set and a disjoint -set , the -da…