Explore >> Select a destination
|
You are here 
|
yufeizhao.com | ||
| | | | |
terrytao.wordpress.com
|
|
| | | | | Let $latex {G = (G,+)}&fg=000000$ be a finite additive group. A tiling pair is a pair of non-empty subsets $latex {A, B}&fg=000000$ such that every element of $latex {G}&fg=000000$ can | |
| | | | |
yufeizhao.wordpress.com
|
|
| | | | | This post is adapted from my new expository survey Extremal regular graphs: independent sets and graph homomorphisms. The earliest result in extremal graph theory is usually credited to Mantel, who proved, in 1907, that a graph on $latex {n}$ vertices with no triangles contains at most $latex {n^2/4}$ edges, where the maximum is achieved for... | |
| | | | |
11011110.github.io
|
|
| | | | | The drawing below shows the Petersen graph (blue vertices), with order-six dihedral symmetry rather than the order-10 symmetry that you're probably more used... | |
| | | | |
curatedsql.com
|
|
| | | |||
