Category Problem of the day

Fair allocation of a pizza

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 […]

Recurrences and the riddle of the day

Sometimes solving exactly a recurrence can be demanding. The use of software can be useful 🙂 Something that I slept under the rag above and I want to mention it since this post by no means is supposed to be intimidating to a novice, is that in many applications (lemmas,theorems etc.) one needs the asymptotic behavior […]