Intereting Posts

Is the integral closure of a Henselian DVR $A$ in a finite extension of its field of fractions finite over $A$?
Embeddability of the cone of Klein bottle to $\mathbb R^4$
Predicate logic for statements about functions?
Books to read to understand Terence Tao's Analytic Number Theory Papers
Absolute continuity of the Lebesgue integral
How to differentiate the following interesting vector product?
Can $\sqrt{a}^\sqrt{b}$ be rational if $\sqrt{a}$ and $\sqrt{b}$ are irrational?
Calculate the number $o(\mathbb{R})$ of open subsets of the real line.
What is a natural number?
Central limit theorem and convergence in probability from Durrett
$\mathbb R^3$ is not a field
Intuitive explanation of why $\dim\operatorname{Im} T + \dim\operatorname{Ker} T = \dim V$
When is an operator on $\ell_1$ the dual of an operator on $c_0$?
How many prime numbers are known?
How to self study Linear Algebra

A complete $k$-partite graph is a graph with disjoint sets of nodes where there is no edges between the nodes in same set, and there is an edge between any node and other nodes in the other subsets.

The subsets are $X_1,\dots,X_p$, and the number of nodes is $N$. What is the maximum number of edges that can be in this complete $k$-partite graph?

- Short proof for the non-Hamiltonicity of the Petersen Graph
- A sequence of $n^2$ real numbers which contains no monotonic subsequence of more than $n$ terms
- Question regarding bipartite graphs and their subgraphs.
- Trees that are isomorphic to a subgraph of a graph G.
- Two disjoint spanning trees, spanning subgraph with all even degrees
- Coloring a Complete Graph in Three Colors, Proving that there is a Complete Subgraph

- How can I find the number of the shortest paths between two points on a 2D lattice grid?
- How to justify unicyclic connected graphs formula?
- Is this graph connected
- What structure does the set of all the matchings in a graph have?
- How many weakly-connected digraphs of n vertices are there without loops and whose vertices all have indegree 1?
- Planar Realization of a Graph in Three-Space
- Proving bipartition in a connected planar graph
- Min. number of vertices in graph as function of $\kappa(G)$ and $\operatorname{diam}(G)$
- Software for generating Cayley graphs of $\mathbb Z_n$?
- Prove that if every node in a simple graph $G$ has degree $3$ or higher, then $G$ contains a cycle with a chord.

Divide up the vertices into your $k$ sets of sizes $a_{1}+…+a_{k}=N$ and consider a vertex in the first set. It has $a_{2}+…+a_{k}$ possible edges to make, therefore the contribution of the first disjoint set is $a_{1}(a_{2}+…+a_{k})$ edges. Since this first set has made as many edges as it may, we then ‘ignore’ these $a_{1}$ vertices and proceed in a similar fashion with the remaining disjoint sets. The total will amount to $a_{1}(a_{2}+…+a_{k})+a_{2}(a_{3}+…+a_{k})+…+a_{k-1}a_{k}$ edges.

If your sets are all of size $n/k$ then the total number of edges should at max be $\frac{n^{2}}{k^{2}}[(k-1)+(k-2)+…+1]=\frac{n^{2}(k-1)}{2k}$.

- Solving recurrences with boundary conditions
- can any continuous function be represented as a sum of convex and concave function?
- Double integral $ \iint\ln(\sin(u-7v)) \,du\,dv$
- Proof of the duality of the dominance order on partitions
- how to solve $\int_{-\infty}^\infty e^{-x^2-x{\tau}} \cdot x\ dx$?
- Wiggly polynomials
- Integration by parts and polar coordinates
- Volterra integral equation with variable boundaries
- The distance function on a metric space
- Integrating a Partial Derivative
- Recurrence Relation for the nth Cantor Set
- Cutting a cube by plane cuts
- Finding a Pythagorean triple $a^2 + b^2 = c^2$ with $a+b+c=40$
- Does the series $\sum_{n=1}^\infty (-1)^n \frac{\cos(\ln(n))}{\sqrt{n}}$ converge?
- Find all integers $x$, $y$, and $z$ such that $\frac{1}{x} + \frac{1}{y} = \frac{1}{z}$