• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 129 matches

• 2023
• 
  Peter Frankl, Andrey Kupavskii:
  Perfect matchings in down-sets. Discret. Math. 346(5): 113323 (2023)
• 
  Dmitriy Kolupaev, Andrey Kupavskii:
  Erdős matching conjecture for almost perfect matchings. Discret. Math. 346(4): 113304 (2023)
• 
  Peter Frankl, Andrey Kupavskii:
  Uniform intersecting families with large covering number. Eur. J. Comb. 113: 103747 (2023)
• 
  Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
  Best possible bounds on the number of distinct differences in intersecting families. Eur. J. Comb. 107: 103601 (2023)
• 
  Alexander Golovanov, Andrey Kupavskii, Arsenii Sagdeev:
  Odd-distance and right-equidistant sets in the maximum and Manhattan metrics. Eur. J. Comb. 107: 103603 (2023)
• 
  Andrey Kupavskii, Aleksei Volostnov, Yury Yarovikov:
  Minimum number of partial triangulations. Eur. J. Comb. 108: 103636 (2023)
• 
  Andrey Kupavskii:
  Erd\H os-Ko-Rado type results for partitions via spread approximations. CoRR abs/2309.00097 (2023)
• 2022
• 
  Nóra Frankl, Andrey Kupavskii:
  Almost Sharp Bounds on the Number of Discrete Chains in the Plane. Comb. 42(6): 1119-1143 (2022)
• 
  Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii:
  Intersection Theorems for Triangles. Discret. Comput. Geom. 68(3): 728-737 (2022)
• 
  Vera Bulankina, Andrey Kupavskii:
  Choice number of Kneser graphs. Discret. Math. 345(11): 113097 (2022)
• 
  Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
  On the maximum number of distinct intersections in an intersecting family. Discret. Math. 345(4): 112757 (2022)
• 
  Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós:
  VC-saturated set systems. Eur. J. Comb. 104: 103528 (2022)
• 
  Peter Frankl, Andrey Kupavskii:
  The Erdős Matching Conjecture and concentration inequalities. J. Comb. Theory, Ser. B 157: 366-400 (2022)
• 
  Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex D. Scott, Jane Tan:
  Reconstructing the degree sequence of a sparse graph from a partial deck. J. Comb. Theory, Ser. B 157: 283-293 (2022)
• 
  Sergei Kiselev, Andrey Kupavskii:
  Sharp bounds for the chromatic number of random Kneser graphs. J. Comb. Theory, Ser. B 157: 96-122 (2022)
• 
  Andrey Kupavskii, Stefan Weltge:
  Binary scalar products. J. Comb. Theory, Ser. B 156: 18-30 (2022)
• 
  Louis Esperet, Nathaniel Harms, Andrey Kupavskii:
  Sketching Distances in Monotone Graph Classes. APPROX/RANDOM 2022: 18:1-18:23
• 
  Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii:
  On Anti-stochastic Properties of Unlabeled Graphs. WG 2022: 300-312
• 
  Peter Frankl, Andrey Kupavskii:
  Perfect matchings in down-sets. CoRR abs/2201.03865 (2022)
• 
  Louis Esperet, Nathaniel Harms, Andrey Kupavskii:
  Sketching Distances in Monotone Graph Classes. CoRR abs/2202.09253 (2022)
• 
  Dmitriy Kolupaev, Andrey Kupavskii:
  Erdős Matching Conjecture for almost perfect matchings. CoRR abs/2206.01526 (2022)
• 
  Andrey Kupavskii, Fedor Noskov:
  Octopuses in the Boolean cube: families with pairwise small intersections, part I. CoRR abs/2209.04756 (2022)
• 2021
• 
  Peter Frankl, Andrey Kupavskii:
  Almost Intersecting Families. Electron. J. Comb. 28(2): 2 (2021)
• 
  Andrey Kupavskii, Emo Welzl:
  Lower bounds for searching robots, some faulty. Distributed Comput. 34(4): 229-237 (2021)
• 
  Peter Frankl, Andrey Kupavskii:
  Beyond the Erdős Matching Conjecture. Eur. J. Comb. 95: 103338 (2021)
• 
  Peter Frankl, Andrey Kupavskii:
  Diversity. J. Comb. Theory, Ser. A 182: 105468 (2021)
• 
  Peter Frankl, Andrey Kupavskii:
  Uniform intersecting families with large covering number. CoRR abs/2106.05344 (2021)
• 
  Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
  Best possible bounds on the number of distinct differences in intersecting families. CoRR abs/2106.05355 (2021)
• 
  Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
  On the maximum number of distinct intersections in an intersecting family. CoRR abs/2108.00479 (2021)
• 
  Vera Bulankina, Andrey Kupavskii:
  Choice number of Kneser graphs. CoRR abs/2108.00502 (2021)

skipping 99 more matches