The following pages link to A Solution to the 2/3 Conjecture (Q3192162):
Displaying 16 items.
- On the algebraic and topological structure of the set of Turán densities (Q256996) (← links)
- Finitely forcible graphons and permutons (Q473103) (← links)
- Inducibility of directed paths (Q785814) (← links)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (Q896063) (← links)
- Finitely forcible graph limits are universal (Q1621473) (← links)
- Further results on an equitable 1-2-3 conjecture (Q2022502) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- Compactness and finite forcibility of graphons (Q2327712) (← links)
- Rainbow triangles in three-colored graphs (Q2399351) (← links)
- Domination in colored complete graphs (Q3490038) (← links)
- Weak regularity and finitely forcible graph limits (Q4608759) (← links)
- A New Bound for the 2/3 Conjecture (Q4921568) (← links)
- Finitely forcible graphons with an almost arbitrary structure (Q5126772) (← links)
- Decomposing Graphs into Edges and Triangles (Q5222546) (← links)
- Minimum Number of Monotone Subsequences of Length 4 in Permutations (Q5364246) (← links)
- C5 ${C}_{5}$ is almost a fractalizer (Q6047976) (← links)
