Simple juntas for shifted families

DOI10.19086/da.14507zbMath1450.05091arXiv1901.03816OpenAlexW2910713864MaRDI QIDQ5126777

Peter Frankl, Andrey B. Kupavskii

Publication date: 20 October 2020

Published in: discrete Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.03816

zbMATH Keywords

extremal set theoryjuntasshifting

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items

Rainbow version of the Erdős Matching Conjecture via concentration ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ A better bound on the size of rainbow matchings ⋮ A proof of Frankl–Kupavskii's conjecture on edge‐union condition ⋮ Estimate of the number of edges in subgraphs of a Johnson graph ⋮ Rainbow matchings for 3-uniform hypergraphs ⋮ Rainbow matchings in k‐partite hypergraphs ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Rainbow matchings in properly-colored hypergraphs
• The complete intersection theorem for systems of finite sets
• Threshold functions
• Boolean functions with low average sensitivity depend on few coordinates
• The junta method in extremal hypergraph theory and Chvátal's conjecture
• The Size of a Hypergraph and its Matching Number
• Intersecting Families are Essentially Contained in Juntas
• Families of finite sets satisfying an intersection condition
• On Rainbow Matchings for Hypergraphs