kupavskii{at}ya.ru Current position:Head of CombGeo lab, MIPT Research interests:Extremal Combinatorics, Discrete and Computational Geometry, Probabilistic Methods, Analysis of Boolean Functions, selected topics in Computer Science, Discrete Optimization, IP Networks and Computing ...
Frankl and Kupavskii proposed the following conjecture: For any 3‐graph F ${m{ {\\mathcal F} }}$ with n $n$ vertices, if F ${m{ {\\mathcal F} }}$ is U(s,2s 1) $U(s,2s 1)$, then e(F)≤maxn12,(ns1)s 12 s 13,2s 13. $\\begin{array}{c}e({\\ma...
Frankl-Kupavskii conjectureA familyFP(n)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\...
The problem of determining the maximum size of a family F that is both r1- wise k1-intersecting and r2-wise k2-intersecting was raised in 2019 by Frankl and Kupavskii (Combinatorica 39:1255-1266, 2019). They proved the surprising result that, for (r1, k1) = (3, 1) and (r2, k2...