What is the maximum size of an antichain of $[n]:=\{1,2,3,\dots,n\}$ (say $\mathcal{A}$) such that $\mid A\cap B\mid \ge k$ where $A,B\in \mathcal{A}$ and $1\le k\le n-1$? By antichain, I mean an antichain of the poset $(2^{[n]},\subseteq)$ where $2^{[n]}$ is the power set of $[n]$. Related: 833011

There are $P$ points in the 2-dimensional plane. Through each point, we draw two orthogonal lines: one horizontal (parallel to x axis), one vertical (parallel to y axis). Obviously, some of these lines conicide. How can we arrange the points such as the total number of lines is minimized? I started with solving the dual […]

Motivated by: Tiling an orthogonal polygon with squares, How to prove that the minimum square partition of a 3X2 rectangle has 3 squares, Minimum square partitions for 4×3 and 5×4 rectangles, What is the minimum square partition of an almost-square rectangle?. Let: An almost-square-rectangle be a rectangle that has a width $w$ and height $h=w-1$. […]

Let $P:\mathbb{Z}_2^n\to\mathbb{Z}_2$ be a polynomial of degree $k$ over the boolean cube. An affine subcube inside $\mathbb{Z}_2^n$ is defined by a basis of $k+1$ linearly independent vectors and an offset in $\mathbb{Z}_2^n$. [See “Testing Low-Degree Polynomials over GF(2)” by Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron – http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.1235 – for more details] […]

I am trying to figure out if a graph can be assumed Hamiltonian or not, or if it’s indeterminable with minimal information: A graph has 17 vertices and 129 edges. Hamiltonian graphs are proved by, as long as the vertices are greater than or equal to 3 (which this is), then if the sum of […]

I am doing research on the sense of smell and have a combinatorics problem: I have 128 different odors (n) and I mix them in mixtures of 10 (r). There are 2.26846154e+14 different mixtures. What I want to know is: What is the size of the group of mixtures such that no mixture in the […]

Apologies for being unsure the best way to express this problem. I have 9 tables with 4 students at each table. I want to re-seat all students so no two students who have sat together ever sit together again. What’s the maximum possible number of re-seatings? Generally, given a set S of students partitioned into […]

What can be said about the rate of growth of $f(n)$, defined by $$f(n) = \min_{|V(G)|=n} \left[ \chi(G) + \chi(\bar{G}) \right],$$ where the minimum is taken over all graphs $G$ on $n$ vertices. Two observations. (1) Either $G$ or $\bar{G}$ contains a clique on roughly $\log{n}$ vertices by Ramsey theory, so $f(n) \ge c_1 \log […]

Are there good lower bounds on the size of a collection of $k$-element subsets of an $n$-element set such that each pair of subsets has at most $m$ elements in common?

This is not a homework question, but I would appreciate if people would treat this as if it were homework. I am looking for (nonspoiler) hints. I would like to prove that given any graph with 10 nodes and 26 edges, there must be at least 5 triangles. Here is the progress I made so […]

Intereting Posts

bayesian probability and measure theory
Five Cubes in Dodecahedron
How to solve this determinant
The preimage of continuous function on a closed set is closed.
$\limsup $ and $\liminf$ of a sequence of subsets relative to a topology
Whether matrix exponential from skew-symmetric 3×3 matrices to SO(3) is local homeomorphism?
Cutting a cube by plane cuts
$f(x)$ and $h(x)$ are absolutely continuous functions. Is $e^{f(x)} |h(x)|$ as well?
Taylor series convergence for $e^{-1/x^2}$
In Godel's first incompleteness theorem, what is the appropriate notion of interpretation function?
de morgan law $A\setminus (B \cap C) = (A\setminus B) \cup (A\setminus C) $
No. Of real roots of an equation
Evaluating $\int_0^1 \frac{\ln^m (1+x)\ln^n x}{x}\; dx$ for $m,n\in\mathbb{N}$
Prove $\det(kA)=k^n\det A$
Example for non-Riemann integrable functions