Andrey Kupavskii

CoRR, May, 2026

More on the Erd\H os-Kleitman problem on matchings in set families.

[BibT_eX]

[DOI]

Georgy Sokolov

CoRR, May, 2026

Families without s-matchings: the other end.

[BibT_eX]

[DOI]

Georgy Sokolov

CoRR, May, 2026

Frankl's diversity theorem for permutations.

[BibT_eX]

[DOI]

Eduard Inozemtsev

CoRR, February, 2026

Cutting corners.

[BibT_eX]

[DOI]

Arsenii Sagdeev

Dmitrii Zakharov

J. Comb. Theory B, 2026

Intersecting families with covering number 3.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2026

The Erdős-Rado sunflower problem for vector spaces.

[BibT_eX]

[DOI]

Ferdinand Ihringer

Finite Fields Their Appl., 2026

Stability for binary scalar products.

[BibT_eX]

[DOI]

Dmitry V. Tsarev

Eur. J. Comb., 2026

Erdős-Ko-Rado type results for partitions via spread approximations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2026

Two questions on Kneser colorings.

[BibT_eX]

[DOI]

Eduard Inozemtsev

Discret. Math., 2026

Tree covers of size 2 for the Euclidean plane.

[BibT_eX]

[DOI]

Artur Bikeev

Maxim Turevskii

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Non-Dissective Coverings by Planks.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025

A complete solution of the Erdős-Kleitman matching problem for n≤3s.

[BibT_eX]

[DOI]

Georgy Sokolov

CoRR, November, 2025

Delta-system method: a survey.

[BibT_eX]

[DOI]

CoRR, August, 2025

Tree covers of size 2 for the Euclidean plane.

[BibT_eX]

[DOI]

Artur Bikeev

Maxim Turevskii

CoRR, August, 2025

A complete t-intersection theorem for families of spanning trees.

[BibT_eX]

[DOI]

Elizaveta Iarovikova

CoRR, July, 2025

Near optimal edge partitioning via intersecting families.

[BibT_eX]

[DOI]

Alexander Yakunin

Stanislav Moiseev

CoRR, May, 2025

The Hajnal-Rothschild problem.

[BibT_eX]

[DOI]

CoRR, February, 2025

Satisfying sequences for rainbow partite matchings.

[BibT_eX]

[DOI]

Elizaveta Popova

CoRR, February, 2025

Intersection Problems and a Correlation Inequality for Integer Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

Maximal Degrees in Subgraphs of Kneser Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2025

Non-trivial r-wise agreeing families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Octopuses in the Boolean cube: Families with pairwise small intersections, part II.

[BibT_eX]

[DOI]

Fedor Noskov

Discret. Math., 2025

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Trivial colors in colorings of Kneser graphs.

[BibT_eX]

[DOI]

Discret. Math., April, 2024

Intersection theorems for (-1,0,1)-vectors.

[BibT_eX]

[DOI]

Eur. J. Comb., March, 2024

On Isomorphism-Invariant Antistochastic Properties of Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Max-norm Ramsey theory.

[BibT_eX]

[DOI]

Arsenii Sagdeev

Eur. J. Comb., 2024

Tilings of Z with multisets of distances.

[BibT_eX]

[DOI]

Elizaveta Popova

Discret. Math., 2024

Structure of non-trivial intersecting families.

[BibT_eX]

[DOI]

CoRR, 2024

Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra.

[BibT_eX]

[DOI]

CoRR, 2024

An almost complete t-intersection theorem for permutations.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Robust Algebraic Connectivity.

[BibT_eX]

[DOI]

Program. Comput. Softw., December, 2023

Octopuses in the Boolean cube: Families with pairwise small intersections, part I.

[BibT_eX]

[DOI]

Fedor Noskov

J. Comb. Theory B, November, 2023

Uniform intersecting families with large covering number.

[BibT_eX]

[DOI]

Eur. J. Comb., October, 2023

Nearly k-Distance Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., October, 2023

Perfect matchings in down-sets.

[BibT_eX]

[DOI]

Discret. Math., May, 2023

Erdős matching conjecture for almost perfect matchings.

[BibT_eX]

[DOI]

Dmitriy Kolupaev

Discret. Math., April, 2023

Minimum number of partial triangulations.

[BibT_eX]

[DOI]

Aleksei Volostnov

Yury Yarovikov

Eur. J. Comb., 2023

Odd-distance and right-equidistant sets in the maximum and Manhattan metrics.

[BibT_eX]

[DOI]

Alexander Golovanov

Arsenii Sagdeev

Eur. J. Comb., 2023

Best possible bounds on the number of distinct differences in intersecting families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2023

Choosing optimal parameters for a distributed multi-constrained QoS routing.

[BibT_eX]

[DOI]

Sergey Komech

Alexei Vezolainen

CoRR, 2023

Erd\H os-Ko-Rado type results for partitions via spread approximations.

[BibT_eX]

[DOI]

CoRR, 2023

Rainbow version of the Erdős Matching Conjecture via concentration.

[BibT_eX]

[DOI]

Comb. Theory, 2023

2022

Binary scalar products.

[BibT_eX]

[DOI]

Stefan Weltge

J. Comb. Theory B, 2022

Sharp bounds for the chromatic number of random Kneser graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Reconstructing the degree sequence of a sparse graph from a partial deck.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

The Erdős Matching Conjecture and concentration inequalities.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

VC-saturated set systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

On the maximum number of distinct intersections in an intersecting family.

[BibT_eX]

[DOI]

Discret. Math., 2022

Choice number of Kneser graphs.

[BibT_eX]

[DOI]

Vera Bulankina

Discret. Math., 2022

Intersection Theorems for Triangles.

[BibT_eX]

[DOI]

Andreas F. Holmsen

Discret. Comput. Geom., 2022

On Anti-stochastic Properties of Unlabeled Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Sketching Distances in Monotone Graph Classes.

[BibT_eX]

[DOI]

Louis Esperet

Nathaniel Harms

Proceedings of the Approximation, 2022

2021

Diversity.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2021

Beyond the Erdős Matching Conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Almost Intersecting Families.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

Rainbow structures in locally bounded colorings of graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, July, 2020

When are epsilon-nets small?

[BibT_eX]

[DOI]

Nikita Zhivotovskiy

J. Comput. Syst. Sci., 2020

The right acute angles problem?

[BibT_eX]

[DOI]

Dmitriy Zakharov

Eur. J. Comb., 2020

Sharp results concerning disjoint cross-intersecting families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Intersection theorems for (-1, 0, 1)-vectors.

[BibT_eX]

[DOI]

CoRR, 2020

Rainbow matchings in k-partite hypergraphs.

[BibT_eX]

[DOI]

CoRR, 2020

The VC-Dimension of K-Vertex D-Polytopes.

[BibT_eX]

[DOI]

Comb., 2020

Almost Sharp Bounds on the Number of Discrete Chains in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Tight Lower Bounds on the VC-dimension of Geometric Set Systems.

[BibT_eX]

[DOI]

Mónika Csikós

J. Mach. Learn. Res., 2019

Degree versions of theorems on intersecting families via stability.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

Two problems on matchings in set families - In the footsteps of Erdős and Kleitman.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Families of sets with no matchings of sizes 3 and 4.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Regular intersecting families.

[BibT_eX]

[DOI]

Ferdinand Ihringer

Discret. Appl. Math., 2019

Bounding the Size of an Almost-Equidistant Set in Euclidean Space.

[BibT_eX]

[DOI]

Konrad J. Swanepoel

Comb. Probab. Comput., 2019

Simple juntas for shifted families.

[BibT_eX]

[DOI]

CoRR, 2019

On the Size of K-Cross-Free Families.

[BibT_eX]

[DOI]

István Tomon

Comb., 2019

Incompatible Intersection Properties.

[BibT_eX]

[DOI]

Comb., 2019

The Crossing Tverberg Theorem.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Short Monadic Second Order Sentences about Sparse Random Graphs.

[BibT_eX]

[DOI]

Maksim Zhukovskii

SIAM J. Discret. Math., 2018

Regular bipartite graphs and intersecting families.

[BibT_eX]

[DOI]

Dmitriy Zakharov

J. Comb. Theory A, 2018

New inequalities for families without k pairwise disjoint members.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

Erdős-Ko-Rado theorem for {0, ±1}-vectors.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

Tilings with noncongruent triangles.

[BibT_eX]

[DOI]

Gábor Tardos

Eur. J. Comb., 2018

Diversity of uniform intersecting families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Colourings of Uniform Hypergraphs with Large Girth and Applications.

[BibT_eX]

[DOI]

Dmitry A. Shabanov

Comb. Probab. Comput., 2018

Counting Intersecting and Pairs of Cross-Intersecting Families.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2018

Optimal Bounds on the VC-dimension.

[BibT_eX]

[DOI]

Mónika Csikós

CoRR, 2018

New inequalities for families without k pairwise disjoint members.

[BibT_eX]

[DOI]

CoRR, 2018

Random Kneser Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Lower Bounds for Searching Robots, some Faulty.

[BibT_eX]

[DOI]

Emo Welzl

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

From Tarski's Plank Problem to Simultaneous Approximation.

[BibT_eX]

[DOI]

Am. Math. Mon., 2017

Families with no s pairwise disjoint sets.

[BibT_eX]

[DOI]

J. Lond. Math. Soc., 2017

Embedding graphs in Euclidean space.

[BibT_eX]

[DOI]

Konrad J. Swanepoel

Electron. Notes Discret. Math., 2017

Families with no matchings of size s.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

A size-sensitive inequality for cross-intersecting families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Uniform s-Cross-Intersecting Families.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2017

Tilings of the plane with unit area triangles of bounded diameter.

[BibT_eX]

[DOI]

Gábor Tardos

CoRR, 2017

Structure and properties of large intersecting families.

[BibT_eX]

[DOI]

CoRR, 2017

Partition-free families of sets.

[BibT_eX]

[DOI]

CoRR, 2017

Families of vectors without antipodal pairs.

[BibT_eX]

[DOI]

CoRR, 2017

Controlling Lipschitz functions.

[BibT_eX]

[DOI]

Gábor Tardos

CoRR, 2017

Proof of Schur's Conjecture in ℝ D.

[BibT_eX]

[DOI]

Alexandr Polyanskii

Comb., 2017

2016

On random subgraphs of Kneser and Schrijver graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2016

The number of double-normals in space.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

Two problems of P. Erdős on matchings in set families.

[BibT_eX]

[DOI]

CoRR, 2016

Intersection theorems for {0, ±1}-vectors and s-cross-intersecting families.

[BibT_eX]

[DOI]

CoRR, 2016

New Lower Bounds for epsilon-Nets.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Simultaneous Approximation of Polynomials.

[BibT_eX]

[DOI]

Andrei Kupavskii

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014

Two notions of unit distance graphs.

[BibT_eX]

[DOI]

Noga Alon

J. Comb. Theory A, 2014

Diameter Graphs in ℝ4.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Number of double-normal pairs in space.

[BibT_eX]

[DOI]

CoRR, 2014

Proof of Schur's conjecture in ℝd.

[BibT_eX]

[DOI]

Alexandr Polyanskii

CoRR, 2014

2013

The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model.

[BibT_eX]

[DOI]

Internet Math., 2013

New bounds for the distance Ramsey number.

[BibT_eX]

[DOI]

Andrei M. Raigorodskii

Maria V. Titova

Discret. Math., 2013

Distance graphs with large chromatic number and arbitrary girth.

[BibT_eX]

[DOI]

CoRR, 2013

Predicting the Audience Size of a Tweet.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Weblogs and Social Media, 2013

2012

Prediction of retweet cascade size over time.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011

On r-colorability of random hypergraphs.

[BibT_eX]

[DOI]

Andrei Kupavskii

Dmitry A. Shabanov

CoRR, 2011

2010

Counterexamples to Borsuk's conjecture on spheres of small radii.

[BibT_eX]

[DOI]

Andrei Kupavskii

Andrei M. Raigorodskii

CoRR, 2010

2009

On the chromatic numbers of small-dimensional Euclidean spaces.

[BibT_eX]

[DOI]