Intereting Posts

What does $b_i\mid b_{i+1}$ mean in this context?
Epimorphism and Monomorphism = Isomorphism?
math-biography of mathematicians
Complement of closed dense set
Right exactness on a dense subcategory
Compound Distribution — Normal Distribution with Log Normally Distributed Variance
Using strong induction to get the AM-GM inequality for $2^n$ numbers
In how many ways can five letters be posted in 4 boxes?
Localization of a ring which is not a domain
What, Exactly, Is a Tensor?
Value range for $a$ when $\enspace 0\leq (e^x-1)\frac{1-(1-x)^a}{x}-x<1\enspace$ with $\enspace 0\leq x\leq 1$ .
Motivation to understand double dual space
Calculating equidistant points around an ellipse arc
Probability of $5$ fair coin flips having strictly more heads than $4$ fair coin flips
Product of perfect maps is perfect

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?

- Labelled spanning trees of $K_n-e$
- Decomposition of complete graph $K_{n}$ into cycles when $n$=9
- Is it possible to define a directed graph “facing” direction?
- In how many ways we can place $N$ mutually non-attacking knights on an $M \times M$ chessboard?
- How to get the adjacency matrix of the dual of $G$ without pen and paper?
- Book recommendation for network theory

- Is there is a way to construct a covering space of a wedge of two circles for a given normal subgroup
- Color the edges of $K_6$ red or blue. Prove that there is a cycle of length 4 with monochromatic edges.
- Existence of a self-complementary graph
- If $\delta(G) \ge (n-1)/2$, then $\lambda(G) = \delta(G)$
- Bipartite graph non-isomorphic to a subgraph of any k-cube
- How many vertices do you need so that all squares are not directly connected?
- Need a counter example for cycle in a graph
- Counting simple, connected, labeled graphs with N vertices and K edges
- How to solve probability with two conditions (with explanation)?
- Is there exists a $k$-iso-regular ($k \ge 3$) non-planar graph of degree at most three?

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}$.

- Find $p(B)$ given $P(A)$, $P(A\cup B)$, and one more piece of information
- Necessary and sufficient condition for $R/IJ \cong R/I \times R/J$
- The most complete reference for identities and special values for polylogarithm and polygamma functions
- Classifying Functions of the form $f(x+y)=f(x)f(y)$
- Prove that $a_{n}=0$ for all $n$, if $\sum a_{kn}=0$ for all $k\geq 1$
- Group $G$ of order $p^2$: $\;G\cong \mathbb Z_{p^2}$ or $G\cong \mathbb Z_p \times \mathbb Z_p$
- Justify: In a metric space every bounded sequence has a convergent subsequence.
- Uncountable set with exactly one limit point
- How to estimate of coefficients of logistic model
- Good textbooks for lattice and coding theory
- What is the solution to the system $\frac{df_n}{dt} = kf_{n-1}-(k+l)f_n+lf_{n+1}$?
- Taylor series in two variables
- A convex function that is bounded on a neighborhood is Lipschitz
- Solving a congruence with high numbers and computing the Legendre symbol
- Galois Theoretic Proof of Fundamental Theorem of Algebra