기초과학연구원 이산수학그룹
I will introduce a new structure on finite graphs, which takes the form of a labeling of the vertices by nonnegative integers (possibly repeated). This labeling is isomorphism invariant, and …
For a set $X$ of integer points, the relaxation complexity $\operatorname{rc}(X)$ is the smallest number of facets of any polyhedron P whose integer points are precisely those of X. In …
A family of sets in $$ is called an $\ell$-Oddtown if the sizes of all sets are not divisible by $\ell$, but the sizes of pairwise intersections are divisible by …