AI Chat AI Image Generator AI Video Text to Speech

Erdős Matching Conjecture for almost perfect matchings

06/03/2022

∙

by Dmitriy Kolupaev, et al.

∙

∙

In 1965 Erdős asked, what is the largest size of a family of k-elements subsets of an n-element set that does not have a matching of size s+1? In this note, we improve upon a recent result of Frankl and resolve this problem for s>101k^3 and (s+1)k≤ n<(s+1)(k+1/100k).

Dmitriy Kolupaev
1 publication
Andrey Kupavskii
35 publications

page 1

page 2

page 3

page 4

research

∙ 06/09/2021

Uniform intersecting families with large covering number

A family ℱ has covering number τ if the size of the smallest set interse...

0 Peter Frankl, et al. ∙

research

∙ 01/26/2019

Beyond the Erdős Matching Conjecture

A family F⊂[n] k is U(s,q) of for any F_1,..., F_s∈ F we have |F_1∪...∪...

0 Peter Frankl, et al. ∙

research

∙ 07/31/2018

Expectation of the Largest Betting Size in Labouchère System

For Labouchère system with winning probability p at each coup, we prove ...

0 Yanjun Han, et al. ∙

research

∙ 02/25/2023

Generalization Bounds for Set-to-Set Matching with Negative Sampling

The problem of matching two sets of multiple elements, namely set-to-set...

0 Masanari Kimura, et al. ∙

research

∙ 10/29/2019

Thresholds versus fractional expectation-thresholds

Proving a conjecture of Talagrand, a fractional version of the 'expectat...

0 Keith Frankston, et al. ∙

research

∙ 07/17/2023

Fixed-Parameter Algorithms for Fair Hitting Set Problems

Selection of a group of representatives satisfying certain fairness cons...

0 Tanmay Inamdar, et al. ∙

research

∙ 05/02/2019

Tight Approximation Bounds for Maximum Multi-Coverage

In the classic maximum coverage problem, we are given subsets T_1, ..., ...

0 Siddharth Barman, et al. ∙