Category Think…
Shortest known paper published
I recently saw a post from OpenCulture, that I explored, and tweeted about: the shortest known paper published in a serious math journal. The Shortest-Known Paper Published in a Serious Math Journal: Two Succinct Sentences https://t.co/6cjmgqOsDC via @openculture — Babis Tsourakakis (@Tsourolampis) March 21, 2017 I wrote few lines of C++ code to search for […]
An observation on edge densities of the union of isomorphic copies of a fixed graph
Consider a fixed graph with vertices and edges respectively. Assume that is balanced which means that the maximum edge density among all possible subgraphs of is achieved from $H$. Take two copies of , call them and create a new graph . In case the two copies are edge disjoint then the edge density of […]
Zarankiewicz’s Problem
Zarankiewicz’s problem plays an important role in extremal combinatorics. Let’s first learn few things about Kazimierz Zarankiewicz from Wikipedia. Unfortunately, his life had a lot of suffering. He had to live the nightmare of concentration camps during World War II and he was a revolutionary. He was not a guerrilla but continued to teach despite the Nazi […]
tsourakakis.com 