Search dblp for Publications

export results for "kupavski"

 download as .bib file

@article{DBLP:journals/ejc/FranklK20,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Sharp results concerning disjoint cross-intersecting families},
  journal   = {Eur. J. Comb.},
  volume    = {86},
  pages     = {103089},
  year      = {2020},
  url       = {https://doi.org/10.1016/j.ejc.2020.103089},
  doi       = {10.1016/j.ejc.2020.103089},
  timestamp = {Mon, 04 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ejc/FranklK20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KupavskiiZ20,
  author    = {Andrey Kupavskii and
               Dmitriy Zakharov},
  title     = {The right acute angles problem?},
  journal   = {Eur. J. Comb.},
  volume    = {89},
  pages     = {103144},
  year      = {2020},
  url       = {https://doi.org/10.1016/j.ejc.2020.103144},
  doi       = {10.1016/j.ejc.2020.103144},
  timestamp = {Tue, 18 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ejc/KupavskiiZ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KupavskiiZ20,
  author    = {Andrey Kupavskii and
               Nikita Zhivotovskiy},
  title     = {When are epsilon-nets small?},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {110},
  pages     = {22--36},
  year      = {2020},
  url       = {https://doi.org/10.1016/j.jcss.2019.12.006},
  doi       = {10.1016/j.jcss.2019.12.006},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/KupavskiiZ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklKS20,
  author    = {N{\'{o}}ra Frankl and
               Andrey Kupavskii and
               Konrad J. Swanepoel},
  title     = {Embedding graphs in Euclidean space},
  journal   = {J. Comb. Theory, Ser. {A}},
  volume    = {171},
  year      = {2020},
  url       = {https://doi.org/10.1016/j.jcta.2019.105146},
  doi       = {10.1016/j.jcta.2019.105146},
  timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jct/FranklKS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FranklK20,
  author    = {N{\'{o}}ra Frankl and
               Andrey Kupavskii},
  editor    = {Sergio Cabello and
               Danny Z. Chen},
  title     = {Almost Sharp Bounds on the Number of Discrete Chains in the Plane},
  booktitle = {36th International Symposium on Computational Geometry, SoCG 2020,
               June 23-26, 2020, Z{\"{u}}rich, Switzerland},
  series    = {LIPIcs},
  volume    = {164},
  pages     = {48:1--48:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2020},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2020.48},
  doi       = {10.4230/LIPIcs.SoCG.2020.48},
  timestamp = {Fri, 12 Jun 2020 14:44:54 +0200},
  biburl    = {https://dblp.org/rec/conf/compgeom/FranklK20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-02181,
  author    = {Sergei Kiselev and
               Andrey Kupavskii},
  title     = {Rainbow matchings in k-partite hypergraphs},
  journal   = {CoRR},
  volume    = {abs/2001.02181},
  year      = {2020},
  url       = {http://arxiv.org/abs/2001.02181},
  archivePrefix = {arXiv},
  eprint    = {2001.02181},
  timestamp = {Mon, 13 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2001-02181.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-04841,
  author    = {Andrey Kupavskii},
  title     = {The VC-dimension of k-vertex d-polytopes},
  journal   = {CoRR},
  volume    = {abs/2004.04841},
  year      = {2020},
  url       = {https://arxiv.org/abs/2004.04841},
  archivePrefix = {arXiv},
  eprint    = {2004.04841},
  timestamp = {Tue, 14 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2004-04841.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08714,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Almost intersecting families},
  journal   = {CoRR},
  volume    = {abs/2004.08714},
  year      = {2020},
  url       = {https://arxiv.org/abs/2004.08714},
  archivePrefix = {arXiv},
  eprint    = {2004.08714},
  timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2004-08714.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08718,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Maximal degrees in subgraphs of Kneser graphs},
  journal   = {CoRR},
  volume    = {abs/2004.08718},
  year      = {2020},
  url       = {https://arxiv.org/abs/2004.08718},
  archivePrefix = {arXiv},
  eprint    = {2004.08718},
  timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2004-08718.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08721,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Intersection theorems for (-1, 0, 1)-vectors},
  journal   = {CoRR},
  volume    = {abs/2004.08721},
  year      = {2020},
  url       = {https://arxiv.org/abs/2004.08721},
  archivePrefix = {arXiv},
  eprint    = {2004.08721},
  timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2004-08721.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-07153,
  author    = {Andrey Kupavskii and
               Stefan Weltge},
  title     = {Binary scalar products},
  journal   = {CoRR},
  volume    = {abs/2008.07153},
  year      = {2020},
  url       = {https://arxiv.org/abs/2008.07153},
  archivePrefix = {arXiv},
  eprint    = {2008.07153},
  timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2008-07153.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-14560,
  author    = {Peter Frankl and
               Andreas F. Holmsen and
               Andrey Kupavskii},
  title     = {Intersection theorems for triangles},
  journal   = {CoRR},
  volume    = {abs/2009.14560},
  year      = {2020},
  url       = {https://arxiv.org/abs/2009.14560},
  archivePrefix = {arXiv},
  eprint    = {2009.14560},
  timestamp = {Wed, 07 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2009-14560.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklK19,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Incompatible Intersection Properties},
  journal   = {Comb.},
  volume    = {39},
  number    = {6},
  pages     = {1255--1266},
  year      = {2019},
  url       = {https://doi.org/10.1007/s00493-019-4064-6},
  doi       = {10.1007/s00493-019-4064-6},
  timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/combinatorica/FranklK19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KupavskiiPT19,
  author    = {Andrey Kupavskii and
               J{\'{a}}nos Pach and
               Istv{\'{a}}n Tomon},
  title     = {On the Size of K-Cross-Free Families},
  journal   = {Comb.},
  volume    = {39},
  number    = {1},
  pages     = {153--164},
  year      = {2019},
  url       = {https://doi.org/10.1007/s00493-017-3792-8},
  doi       = {10.1007/s00493-017-3792-8},
  timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/combinatorica/KupavskiiPT19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KupavskiiMS19,
  author    = {Andrey Kupavskii and
               Nabil H. Mustafa and
               Konrad J. Swanepoel},
  title     = {Bounding the Size of an Almost-Equidistant Set in Euclidean Space},
  journal   = {Comb. Probab. Comput.},
  volume    = {28},
  number    = {2},
  pages     = {280--286},
  year      = {2019},
  url       = {https://doi.org/10.1017/S0963548318000287},
  doi       = {10.1017/S0963548318000287},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cpc/KupavskiiMS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/IhringerK19,
  author    = {Ferdinand Ihringer and
               Andrey Kupavskii},
  title     = {Regular intersecting families},
  journal   = {Discret. Appl. Math.},
  volume    = {270},
  pages     = {142--152},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.dam.2019.07.009},
  doi       = {10.1016/j.dam.2019.07.009},
  timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dam/IhringerK19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklK19,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Families of sets with no matchings of sizes 3 and 4},
  journal   = {Eur. J. Comb.},
  volume    = {75},
  pages     = {123--135},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.ejc.2018.08.005},
  doi       = {10.1016/j.ejc.2018.08.005},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ejc/FranklK19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklK19,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Two problems on matchings in set families - In the footsteps of Erd{\H{o}}s
               and Kleitman},
  journal   = {J. Comb. Theory, Ser. {B}},
  volume    = {138},
  pages     = {286--313},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.jctb.2019.02.004},
  doi       = {10.1016/j.jctb.2019.02.004},
  timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jct/FranklK19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kupavskii19,
  author    = {Andrey Kupavskii},
  title     = {Degree versions of theorems on intersecting families via stability},
  journal   = {J. Comb. Theory, Ser. {A}},
  volume    = {168},
  pages     = {272--287},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.jcta.2019.06.002},
  doi       = {10.1016/j.jcta.2019.06.002},
  timestamp = {Wed, 21 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jct/Kupavskii19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/CsikosMK19,
  author    = {M{\'{o}}nika Csik{\'{o}}s and
               Nabil H. Mustafa and
               Andrey Kupavskii},
  title     = {Tight Lower Bounds on the VC-dimension of Geometric Set Systems},
  journal   = {J. Mach. Learn. Res.},
  volume    = {20},
  pages     = {81:1--81:8},
  year      = {2019},
  url       = {http://jmlr.org/papers/v20/18-719.html},
  timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jmlr/CsikosMK19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FulekGKV019,
  author    = {Radoslav Fulek and
               Bernd G{\"{a}}rtner and
               Andrey Kupavskii and
               Pavel Valtr and
               Uli Wagner},
  editor    = {Gill Barequet and
               Yusu Wang},
  title     = {The Crossing Tverberg Theorem},
  booktitle = {35th International Symposium on Computational Geometry, SoCG 2019,
               June 18-21, 2019, Portland, Oregon, {USA}},
  series    = {LIPIcs},
  volume    = {129},
  pages     = {38:1--38:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2019.38},
  doi       = {10.4230/LIPIcs.SoCG.2019.38},
  timestamp = {Fri, 12 Jun 2020 15:04:05 +0200},
  biburl    = {https://dblp.org/rec/conf/compgeom/FulekGKV019.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-03816,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Simple juntas for shifted families},
  journal   = {CoRR},
  volume    = {abs/1901.03816},
  year      = {2019},
  url       = {http://arxiv.org/abs/1901.03816},
  archivePrefix = {arXiv},
  eprint    = {1901.03816},
  timestamp = {Sun, 03 Feb 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1901-03816.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-09278,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Beyond the Erd{\H{o}}s Matching Conjecture},
  journal   = {CoRR},
  volume    = {abs/1901.09278},
  year      = {2019},
  url       = {http://arxiv.org/abs/1901.09278},
  archivePrefix = {arXiv},
  eprint    = {1901.09278},
  timestamp = {Sun, 03 Feb 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1901-09278.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-08123,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Sharp results concerning disjoint cross-intersecting families},
  journal   = {CoRR},
  volume    = {abs/1905.08123},
  year      = {2019},
  url       = {http://arxiv.org/abs/1905.08123},
  archivePrefix = {arXiv},
  eprint    = {1905.08123},
  timestamp = {Wed, 29 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1905-08123.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Kupavskii18,
  author    = {Andrey Kupavskii},
  title     = {Random Kneser Graphs and Hypergraphs},
  journal   = {Electron. J. Comb.},
  volume    = {25},
  number    = {4},
  pages     = {P4.52},
  year      = {2018},
  url       = {https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p52},
  timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/combinatorics/Kupavskii18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FranklK18,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Counting Intersecting and Pairs of Cross-Intersecting Families},
  journal   = {Comb. Probab. Comput.},
  volume    = {27},
  number    = {1},
  pages     = {60--68},
  year      = {2018},
  url       = {https://doi.org/10.1017/S0963548317000529},
  doi       = {10.1017/S0963548317000529},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cpc/FranklK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KupavskiiS18,
  author    = {Andrey Kupavskii and
               Dmitry A. Shabanov},
  title     = {Colourings of Uniform Hypergraphs with Large Girth and Applications},
  journal   = {Comb. Probab. Comput.},
  volume    = {27},
  number    = {2},
  pages     = {245--273},
  year      = {2018},
  url       = {https://doi.org/10.1017/S0963548317000475},
  doi       = {10.1017/S0963548317000475},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cpc/KupavskiiS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Kupavskii18,
  author    = {Andrey Kupavskii},
  title     = {Diversity of uniform intersecting families},
  journal   = {Eur. J. Comb.},
  volume    = {74},
  pages     = {39--47},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ejc.2018.07.005},
  doi       = {10.1016/j.ejc.2018.07.005},
  timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ejc/Kupavskii18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KupavskiiPT18,
  author    = {Andrey Kupavskii and
               J{\'{a}}nos Pach and
               G{\'{a}}bor Tardos},
  title     = {Tilings with noncongruent triangles},
  journal   = {Eur. J. Comb.},
  volume    = {73},
  pages     = {72--80},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ejc.2018.05.005},
  doi       = {10.1016/j.ejc.2018.05.005},
  timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ejc/KupavskiiPT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklK18,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Erd{\H{o}}s-Ko-Rado theorem for \{0, {\(\pm\)}1\}-vectors},
  journal   = {J. Comb. Theory, Ser. {A}},
  volume    = {155},
  pages     = {157--179},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.jcta.2017.11.003},
  doi       = {10.1016/j.jcta.2017.11.003},
  timestamp = {Mon, 22 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jct/FranklK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklK18a,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {New inequalities for families without \emph{k} pairwise disjoint members},
  journal   = {J. Comb. Theory, Ser. {A}},
  volume    = {157},
  pages     = {427--434},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.jcta.2018.01.007},
  doi       = {10.1016/j.jcta.2018.01.007},
  timestamp = {Wed, 02 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jct/FranklK18a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KupavskiiZ18,
  author    = {Andrey Kupavskii and
               Dmitriy Zakharov},
  title     = {Regular bipartite graphs and intersecting families},
  journal   = {J. Comb. Theory, Ser. {A}},
  volume    = {155},
  pages     = {180--189},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.jcta.2017.11.006},
  doi       = {10.1016/j.jcta.2017.11.006},
  timestamp = {Mon, 22 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jct/KupavskiiZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KupavskiiZ18,
  author    = {Andrey Kupavskii and
               Maksim Zhukovskii},
  title     = {Short Monadic Second Order Sentences about Sparse Random Graphs},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {32},
  number    = {4},
  pages     = {2916--2940},
  year      = {2018},
  url       = {https://doi.org/10.1137/16M1103105},
  doi       = {10.1137/16M1103105},
  timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/KupavskiiZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/KupavskiiW18,
  author    = {Andrey Kupavskii and
               Emo Welzl},
  editor    = {Calvin Newport and
               Idit Keidar},
  title     = {Lower Bounds for Searching Robots, some Faulty},
  booktitle = {Proceedings of the 2018 {ACM} Symposium on Principles of Distributed
               Computing, {PODC} 2018, Egham, United Kingdom, July 23-27, 2018},
  pages     = {447--453},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://dl.acm.org/citation.cfm?id=3212745},
  timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/podc/KupavskiiW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03581,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {New inequalities for families without k pairwise disjoint members},
  journal   = {CoRR},
  volume    = {abs/1804.03581},
  year      = {2018},
  url       = {http://arxiv.org/abs/1804.03581},
  archivePrefix = {arXiv},
  eprint    = {1804.03581},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1804-03581.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07924,
  author    = {M{\'{o}}nika Csik{\'{o}}s and
               Andrey Kupavskii and
               Nabil H. Mustafa},
  title     = {Optimal Bounds on the VC-dimension},
  journal   = {CoRR},
  volume    = {abs/1807.07924},
  year      = {2018},
  url       = {http://arxiv.org/abs/1807.07924},
  archivePrefix = {arXiv},
  eprint    = {1807.07924},
  timestamp = {Wed, 08 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1807-07924.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-01229,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Incompatible intersection properties},
  journal   = {CoRR},
  volume    = {abs/1808.01229},
  year      = {2018},
  url       = {http://arxiv.org/abs/1808.01229},
  archivePrefix = {arXiv},
  eprint    = {1808.01229},
  timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1808-01229.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-00915,
  author    = {Andrey Kupavskii},
  title     = {Degree versions of theorems on intersecting families via stability},
  journal   = {CoRR},
  volume    = {abs/1810.00915},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.00915},
  archivePrefix = {arXiv},
  eprint    = {1810.00915},
  timestamp = {Thu, 01 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1810-00915.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-00920,
  author    = {Andrey Kupavskii},
  title     = {Structure and properties of large intersecting families},
  journal   = {CoRR},
  volume    = {abs/1810.00920},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.00920},
  archivePrefix = {arXiv},
  eprint    = {1810.00920},
  timestamp = {Thu, 01 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1810-00920.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-01161,
  author    = {Sergei Kiselev and
               Andrey Kupavskii},
  title     = {Sharp bounds for the chromatic number of random Kneser graphs},
  journal   = {CoRR},
  volume    = {abs/1810.01161},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.01161},
  archivePrefix = {arXiv},
  eprint    = {1810.01161},
  timestamp = {Thu, 01 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1810-01161.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-01111,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Diversity},
  journal   = {CoRR},
  volume    = {abs/1811.01111},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.01111},
  archivePrefix = {arXiv},
  eprint    = {1811.01111},
  timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1811-01111.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-04911,
  author    = {Radoslav Fulek and
               Bernd G{\"{a}}rtner and
               Andrey Kupavskii and
               Pavel Valtr and
               Uli Wagner},
  title     = {The Crossing Tverberg Theorem},
  journal   = {CoRR},
  volume    = {abs/1812.04911},
  year      = {2018},
  url       = {http://arxiv.org/abs/1812.04911},
  archivePrefix = {arXiv},
  eprint    = {1812.04911},
  timestamp = {Thu, 03 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1812-04911.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KupavskiiP17,
  author    = {Andrey B. Kupavskii and
               Alexandr Polyanskii},
  title     = {Proof of Schur's Conjecture in {\(\mathbb{R}\)} {D}},
  journal   = {Comb.},
  volume    = {37},
  number    = {6},
  pages     = {1181--1205},
  year      = {2017},
  url       = {https://doi.org/10.1007/s00493-016-3340-y},
  doi       = {10.1007/s00493-016-3340-y},
  timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/combinatorica/KupavskiiP17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FranklK17,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Uniform s-Cross-Intersecting Families},
  journal   = {Comb. Probab. Comput.},
  volume    = {26},
  number    = {4},
  pages     = {517--524},
  year      = {2017},
  url       = {https://doi.org/10.1017/S0963548317000062},
  doi       = {10.1017/S0963548317000062},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cpc/FranklK17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklK17,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {A size-sensitive inequality for cross-intersecting families},
  journal   = {Eur. J. Comb.},
  volume    = {62},
  pages     = {263--271},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.ejc.2017.01.004},
  doi       = {10.1016/j.ejc.2017.01.004},
  timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ejc/FranklK17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FranklK17,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Families with no matchings of size s},
  journal   = {Electron. Notes Discret. Math.},
  volume    = {61},
  pages     = {483--489},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.endm.2017.06.077},
  doi       = {10.1016/j.endm.2017.06.077},
  timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/endm/FranklK17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FranklKS17,
  author    = {N{\'{o}}ra Frankl and
               Andrey Kupavskii and
               Konrad J. Swanepoel},
  title     = {Embedding graphs in Euclidean space},
  journal   = {Electron. Notes Discret. Math.},
  volume    = {61},
  pages     = {475--481},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.endm.2017.06.076},
  doi       = {10.1016/j.endm.2017.06.076},
  timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/endm/FranklKS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlms/FranklK17,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Families with no s pairwise disjoint sets},
  journal   = {J. Lond. Math. Soc.},
  volume    = {95},
  number    = {3},
  pages     = {875--894},
  year      = {2017},
  url       = {https://doi.org/10.1112/jlms.12041},
  doi       = {10.1112/jlms.12041},
  timestamp = {Mon, 25 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jlms/FranklK17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KupavskiiW17,
  author    = {Andrey Kupavskii and
               Emo Welzl},
  title     = {Lower Bounds for Searching Robots, some Faulty},
  journal   = {CoRR},
  volume    = {abs/1707.05077},
  year      = {2017},
  url       = {http://arxiv.org/abs/1707.05077},
  archivePrefix = {arXiv},
  eprint    = {1707.05077},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/KupavskiiW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1701-04107,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Families of sets with no matchings of sizes 3 and 4},
  journal   = {CoRR},
  volume    = {abs/1701.04107},
  year      = {2017},
  url       = {http://arxiv.org/abs/1701.04107},
  archivePrefix = {arXiv},
  eprint    = {1701.04107},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1701-04107.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1701-04110,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Counting intersecting and pairs of cross-intersecting families},
  journal   = {CoRR},
  volume    = {abs/1701.04110},
  year      = {2017},
  url       = {http://arxiv.org/abs/1701.04110},
  archivePrefix = {arXiv},
  eprint    = {1701.04110},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1701-04110.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1704-03062,
  author    = {Andrey Kupavskii and
               J{\'{a}}nos Pach and
               G{\'{a}}bor Tardos},
  title     = {Controlling Lipschitz functions},
  journal   = {CoRR},
  volume    = {abs/1704.03062},
  year      = {2017},
  url       = {http://arxiv.org/abs/1704.03062},
  archivePrefix = {arXiv},
  eprint    = {1704.03062},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1704-03062.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1705-07216,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Families of vectors without antipodal pairs},
  journal   = {CoRR},
  volume    = {abs/1705.07216},
  year      = {2017},
  url       = {http://arxiv.org/abs/1705.07216},
  archivePrefix = {arXiv},
  eprint    = {1705.07216},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1705-07216.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1706-00215,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Partition-free families of sets},
  journal   = {CoRR},
  volume    = {abs/1706.00215},
  year      = {2017},
  url       = {http://arxiv.org/abs/1706.00215},
  archivePrefix = {arXiv},
  eprint    = {1706.00215},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1706-00215.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-01590,
  author    = {Andrey Kupavskii and
               Nabil H. Mustafa and
               Konrad J. Swanepoel},
  title     = {Bounding the size of an almost-equidistant set in Euclidean space},
  journal   = {CoRR},
  volume    = {abs/1708.01590},
  year      = {2017},
  url       = {http://arxiv.org/abs/1708.01590},
  archivePrefix = {arXiv},
  eprint    = {1708.01590},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1708-01590.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02829,
  author    = {Andrey Kupavskii},
  title     = {Diversity of uniform intersecting families},
  journal   = {CoRR},
  volume    = {abs/1709.02829},
  year      = {2017},
  url       = {http://arxiv.org/abs/1709.02829},
  archivePrefix = {arXiv},
  eprint    = {1709.02829},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1709-02829.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-10462,
  author    = {Ferdinand Ihringer and
               Andrey Kupavskii},
  title     = {Regular Intersecting Families},
  journal   = {CoRR},
  volume    = {abs/1709.10462},
  year      = {2017},
  url       = {http://arxiv.org/abs/1709.10462},
  archivePrefix = {arXiv},
  eprint    = {1709.10462},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1709-10462.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-02440,
  author    = {Andrey Kupavskii},
  title     = {Structure and properties of large intersecting families},
  journal   = {CoRR},
  volume    = {abs/1710.02440},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.02440},
  archivePrefix = {arXiv},
  eprint    = {1710.02440},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1710-02440.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-04504,
  author    = {Andrey Kupavskii and
               J{\'{a}}nos Pach and
               G{\'{a}}bor Tardos},
  title     = {Tilings with noncongruent triangles},
  journal   = {CoRR},
  volume    = {abs/1711.04504},
  year      = {2017},
  url       = {http://arxiv.org/abs/1711.04504},
  archivePrefix = {arXiv},
  eprint    = {1711.04504},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1711-04504.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-10414,
  author    = {Andrey Kupavskii and
               Nikita Zhivotovskiy},
  title     = {When are epsilon-nets small?},
  journal   = {CoRR},
  volume    = {abs/1711.10414},
  year      = {2017},
  url       = {http://arxiv.org/abs/1711.10414},
  archivePrefix = {arXiv},
  eprint    = {1711.10414},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1711-10414.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-03118,
  author    = {Andrey Kupavskii and
               J{\'{a}}nos Pach and
               G{\'{a}}bor Tardos},
  title     = {Tilings of the plane with unit area triangles of bounded diameter},
  journal   = {CoRR},
  volume    = {abs/1712.03118},
  year      = {2017},
  url       = {http://arxiv.org/abs/1712.03118},
  archivePrefix = {arXiv},
  eprint    = {1712.03118},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1712-03118.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Kupavskii16,
  author    = {Andrey Kupavskii},
  title     = {The number of double-normals in space},
  journal   = {Discret. Comput. Geom.},
  volume    = {56},
  number    = {3},
  pages     = {711--726},
  year      = {2016},
  url       = {https://doi.org/10.1007/s00454-016-9804-4},
  doi       = {10.1007/s00454-016-9804-4},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dcg/Kupavskii16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kupavskii16,
  author    = {Andrey Kupavskii},
  title     = {On random subgraphs of Kneser and Schrijver graphs},
  journal   = {J. Comb. Theory, Ser. {A}},
  volume    = {141},
  pages     = {8--15},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.jcta.2016.02.003},
  doi       = {10.1016/j.jcta.2016.02.003},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jct/Kupavskii16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KupavskiiMP16,
  author    = {Andrey Kupavskii and
               Nabil H. Mustafa and
               J{\'{a}}nos Pach},
  editor    = {S{\'{a}}ndor P. Fekete and
               Anna Lubiw},
  title     = {New Lower Bounds for epsilon-Nets},
  booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
               June 14-18, 2016, Boston, MA, {USA}},
  series    = {LIPIcs},
  volume    = {51},
  pages     = {54:1--54:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2016},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2016.54},
  doi       = {10.4230/LIPIcs.SoCG.2016.54},
  timestamp = {Fri, 12 Jun 2020 15:03:56 +0200},
  biburl    = {https://dblp.org/rec/conf/compgeom/KupavskiiMP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1603-00936,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {A size-sensitive inequality for cross-intersecting families},
  journal   = {CoRR},
  volume    = {abs/1603.00936},
  year      = {2016},
  url       = {http://arxiv.org/abs/1603.00936},
  archivePrefix = {arXiv},
  eprint    = {1603.00936},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1603-00936.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1603-00938,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Intersection theorems for \{0, {\(\pm\)}1\}-vectors and s-cross-intersecting
               families},
  journal   = {CoRR},
  volume    = {abs/1603.00938},
  year      = {2016},
  url       = {http://arxiv.org/abs/1603.00938},
  archivePrefix = {arXiv},
  eprint    = {1603.00938},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1603-00938.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1607-06122,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Families with no s pairwise disjoint sets},
  journal   = {CoRR},
  volume    = {abs/1607.06122},
  year      = {2016},
  url       = {http://arxiv.org/abs/1607.06122},
  archivePrefix = {arXiv},
  eprint    = {1607.06122},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1607-06122.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1607-06126,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Two problems of P. Erd{\H{o}}s on matchings in set families},
  journal   = {CoRR},
  volume    = {abs/1607.06126},
  year      = {2016},
  url       = {http://arxiv.org/abs/1607.06126},
  archivePrefix = {arXiv},
  eprint    = {1607.06126},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1607-06126.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1611-03129,
  author    = {Andrey Kupavskii and
               Dmitriy Zakharov},
  title     = {Regular bipartite graphs and intersecting families},
  journal   = {CoRR},
  volume    = {abs/1611.03129},
  year      = {2016},
  url       = {http://arxiv.org/abs/1611.03129},
  archivePrefix = {arXiv},
  eprint    = {1611.03129},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1611-03129.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1611-07258,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Uniform s-cross-intersecting families},
  journal   = {CoRR},
  volume    = {abs/1611.07258},
  year      = {2016},
  url       = {http://arxiv.org/abs/1611.07258},
  archivePrefix = {arXiv},
  eprint    = {1611.07258},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1611-07258.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1611-07260,
  author    = {Andrey Kupavskii and
               Maksim Zhukovskii},
  title     = {Short monadic second order sentences about sparse random graphs},
  journal   = {CoRR},
  volume    = {abs/1611.07260},
  year      = {2016},
  url       = {http://arxiv.org/abs/1611.07260},
  archivePrefix = {arXiv},
  eprint    = {1611.07260},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1611-07260.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1612-03868,
  author    = {Andrey Kupavskii},
  title     = {Random Kneser graphs and hypergraphs},
  journal   = {CoRR},
  volume    = {abs/1612.03868},
  year      = {2016},
  url       = {http://arxiv.org/abs/1612.03868},
  archivePrefix = {arXiv},
  eprint    = {1612.03868},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1612-03868.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/KupavskiiP15,
  author    = {Andrei Kupavskii and
               J{\'{a}}nos Pach},
  editor    = {Jin Akiyama and
               Hiro Ito and
               Toshinori Sakai and
               Yushi Uno},
  title     = {Simultaneous Approximation of Polynomials},
  booktitle = {Discrete and Computational Geometry and Graphs - 18th Japan Conference,
               {JCDCGG} 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected
               Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {9943},
  pages     = {193--203},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-48532-4\_17},
  doi       = {10.1007/978-3-319-48532-4\_17},
  timestamp = {Tue, 14 May 2019 10:00:52 +0200},
  biburl    = {https://dblp.org/rec/conf/jcdcg/KupavskiiP15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1502-00699,
  author    = {Andrey B. Kupavskii},
  title     = {On random subgraphs of Kneser and Schrijver graphs},
  journal   = {CoRR},
  volume    = {abs/1502.00699},
  year      = {2015},
  url       = {http://arxiv.org/abs/1502.00699},
  archivePrefix = {arXiv},
  eprint    = {1502.00699},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1502-00699.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1510-03912,
  author    = {Peter Frankl and
               Andrey Kupavskii},
  title     = {Erd{\H{o}}s-Ko-Rado theorem for \{0, {\(\pm\)}: 1\}-vectors},
  journal   = {CoRR},
  volume    = {abs/1510.03912},
  year      = {2015},
  url       = {http://arxiv.org/abs/1510.03912},
  archivePrefix = {arXiv},
  eprint    = {1510.03912},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1510-03912.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1511-08111,
  author    = {Andrey B. Kupavskii and
               J{\'{a}}nos Pach},
  title     = {From Tarski's plank problem to simultaneous approximation},
  journal   = {CoRR},
  volume    = {abs/1511.08111},
  year      = {2015},
  url       = {http://arxiv.org/abs/1511.08111},
  archivePrefix = {arXiv},
  eprint    = {1511.08111},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1511-08111.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Kupavskii14,
  author    = {Andrey Kupavskii},
  title     = {Diameter Graphs in {\(\mathbb{R}\)}\({}^{\mbox{4}}\)},
  journal   = {Discret. Comput. Geom.},
  volume    = {51},
  number    = {4},
  pages     = {842--858},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00454-014-9581-x},
  doi       = {10.1007/s00454-014-9581-x},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dcg/Kupavskii14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AlonK14,
  author    = {Noga Alon and
               Andrey Kupavskii},
  title     = {Two notions of unit distance graphs},
  journal   = {J. Comb. Theory, Ser. {A}},
  volume    = {125},
  pages     = {1--17},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.jcta.2014.02.006},
  doi       = {10.1016/j.jcta.2014.02.006},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jct/AlonK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1402-3694,
  author    = {Andrey B. Kupavskii and
               Alexandr Polyanskii},
  title     = {Proof of Schur's conjecture in {\(\mathbb{R}\)}\({}^{\mbox{d}}\)},
  journal   = {CoRR},
  volume    = {abs/1402.3694},
  year      = {2014},
  url       = {http://arxiv.org/abs/1402.3694},
  archivePrefix = {arXiv},
  eprint    = {1402.3694},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1402-3694.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1412-4405,
  author    = {Andrey Kupavskii},
  title     = {Number of double-normal pairs in space},
  journal   = {CoRR},
  volume    = {abs/1412.4405},
  year      = {2014},
  url       = {http://arxiv.org/abs/1412.4405},
  archivePrefix = {arXiv},
  eprint    = {1412.4405},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1412-4405.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KupavskiiRT13,
  author    = {Andrey B. Kupavskii and
               Andrei M. Raigorodskii and
               Maria V. Titova},
  title     = {New bounds for the distance Ramsey number},
  journal   = {Discret. Math.},
  volume    = {313},
  number    = {22},
  pages     = {2566--2574},
  year      = {2013},
  url       = {https://doi.org/10.1016/j.disc.2013.07.022},
  doi       = {10.1016/j.disc.2013.07.022},
  timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dm/KupavskiiRT13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/KupavskiiOST13,
  author    = {Andrey Kupavskii and
               Liudmila Ostroumova and
               Dmitry A. Shabanov and
               Prasad Tetali},
  title     = {The Distribution of Second Degrees in the Buckley-Osthus Random Graph
               Model},
  journal   = {Internet Math.},
  volume    = {9},
  number    = {4},
  pages     = {297--335},
  year      = {2013},
  url       = {https://doi.org/10.1080/15427951.2012.727375},
  doi       = {10.1080/15427951.2012.727375},
  timestamp = {Sun, 17 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/im/KupavskiiOST13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icwsm/KupavskiiUGS13,
  author    = {Andrey Kupavskii and
               Alexey Umnov and
               Gleb Gusev and
               Pavel Serdyukov},
  editor    = {Emre Kiciman and
               Nicole B. Ellison and
               Bernie Hogan and
               Paul Resnick and
               Ian Soboroff},
  title     = {Predicting the Audience Size of a Tweet},
  booktitle = {Proceedings of the Seventh International Conference on Weblogs and
               Social Media, {ICWSM} 2013, Cambridge, Massachusetts, USA, July 8-11,
               2013},
  publisher = {The {AAAI} Press},
  year      = {2013},
  url       = {http://www.aaai.org/ocs/index.php/ICWSM/ICWSM13/paper/view/6077},
  timestamp = {Tue, 20 Aug 2013 12:53:36 +0200},
  biburl    = {https://dblp.org/rec/conf/icwsm/KupavskiiUGS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5715,
  author    = {Andrey Kupavskii and
               Liudmila Ostroumova and
               Dmitry A. Shabanov and
               Prasad Tetali},
  title     = {The distribution of second degrees in the Buckley-Osthus random graph
               model},
  journal   = {CoRR},
  volume    = {abs/1304.5715},
  year      = {2013},
  url       = {http://arxiv.org/abs/1304.5715},
  archivePrefix = {arXiv},
  eprint    = {1304.5715},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1304-5715.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1306-3910,
  author    = {Andrey Kupavskii},
  title     = {Diameter graphs in {\(\mathbb{R}\)}\({}^{\mbox{4}}\)},
  journal   = {CoRR},
  volume    = {abs/1306.3910},
  year      = {2013},
  url       = {http://arxiv.org/abs/1306.3910},
  archivePrefix = {arXiv},
  eprint    = {1306.3910},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1306-3910.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1306-3916,
  author    = {Noga Alon and
               Andrey Kupavskii},
  title     = {Two notions of unit distance graphs},
  journal   = {CoRR},
  volume    = {abs/1306.3916},
  year      = {2013},
  url       = {http://arxiv.org/abs/1306.3916},
  archivePrefix = {arXiv},
  eprint    = {1306.3916},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1306-3916.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1306-3921,
  author    = {Andrey Kupavskii},
  title     = {Distance graphs with large chromatic number and arbitrary girth},
  journal   = {CoRR},
  volume    = {abs/1306.3921},
  year      = {2013},
  url       = {http://arxiv.org/abs/1306.3921},
  archivePrefix = {arXiv},
  eprint    = {1306.3921},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1306-3921.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1307-0843,
  author    = {Andrey B. Kupavskii and
               Andrei M. Raigorodskii and
               Maria V. Titova},
  title     = {New bounds for the distance Ramsey number},
  journal   = {CoRR},
  volume    = {abs/1307.0843},
  year      = {2013},
  url       = {http://arxiv.org/abs/1307.0843},
  archivePrefix = {arXiv},
  eprint    = {1307.0843},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1307-0843.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/KupavskiiOUUSGK12,
  author    = {Andrey Kupavskii and
               Liudmila Ostroumova and
               Alexey Umnov and
               Svyatoslav Usachev and
               Pavel Serdyukov and
               Gleb Gusev and
               Andrey Kustarev},
  editor    = {Xue{-}wen Chen and
               Guy Lebanon and
               Haixun Wang and
               Mohammed J. Zaki},
  title     = {Prediction of retweet cascade size over time},
  booktitle = {21st {ACM} International Conference on Information and Knowledge Management,
               CIKM'12, Maui, HI, USA, October 29 - November 02, 2012},
  pages     = {2335--2338},
  publisher = {{ACM}},
  year      = {2012},
  url       = {https://doi.org/10.1145/2396761.2398634},
  doi       = {10.1145/2396761.2398634},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/cikm/KupavskiiOUUSGK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kupavskiy11,
  author    = {Andrey Kupavskiy},
  title     = {On the chromatic number of R\({}^{\mbox{n}}\) with an arbitrary norm},
  journal   = {Discret. Math.},
  volume    = {311},
  number    = {6},
  pages     = {437--440},
  year      = {2011},
  url       = {https://doi.org/10.1016/j.disc.2010.12.005},
  doi       = {10.1016/j.disc.2010.12.005},
  timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dm/Kupavskiy11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-1249,
  author    = {Andrei Kupavskii and
               Dmitry A. Shabanov},
  title     = {On r-colorability of random hypergraphs},
  journal   = {CoRR},
  volume    = {abs/1110.1249},
  year      = {2011},
  url       = {http://arxiv.org/abs/1110.1249},
  archivePrefix = {arXiv},
  eprint    = {1110.1249},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1110-1249.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-0383,
  author    = {Andrei Kupavskii and
               Andrei M. Raigorodskii},
  title     = {Counterexamples to Borsuk's conjecture on spheres of small radii},
  journal   = {CoRR},
  volume    = {abs/1010.0383},
  year      = {2010},
  url       = {http://arxiv.org/abs/1010.0383},
  archivePrefix = {arXiv},
  eprint    = {1010.0383},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1010-0383.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KupavskiiR09,
  author    = {Andrey B. Kupavskii and
               Andrei M. Raigorodskii},
  title     = {On the chromatic numbers of small-dimensional Euclidean spaces},
  journal   = {Electron. Notes Discret. Math.},
  volume    = {34},
  pages     = {435--439},
  year      = {2009},
  url       = {https://doi.org/10.1016/j.endm.2009.07.072},
  doi       = {10.1016/j.endm.2009.07.072},
  timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/endm/KupavskiiR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics