Non-averaging subsets and non-vanishing transversals

DOI10.1006/jcta.1998.2926zbMath0927.11007OpenAlexW2087913324MaRDI QIDQ1284465

Noga Alon, Imre Z. Ruzsa

Publication date: 12 December 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1998.2926

zbMATH Keywords

non-averaging subsetsnonvanishing transversal

Mathematics Subject Classification ID

Special sequences and polynomials (11B83)

Related Items (7)

Correlation among runners and some results on the lonely runner conjecture ⋮ An approximate version of Sidorenko's conjecture ⋮ Tree-Degenerate Graphs and Nested Dependent Random Choice ⋮ The Turán number of the grid ⋮ Invisible runners in finite fields ⋮ On Hamiltonian cycles in hypergraphs with dense link graphs ⋮ On uniformly distributed dilates of finite integer sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Erdős-Straus non-averaging set problem
• Extremal problems on non-averaging and non-dividing sets
• Uniform dilations
• On the lower estimation of non-averaging sets
• Compactness results in extremal graph theory
• Multiplicities of subgraphs
• On non-averaging sets of integers
• Linear problems in combinatorial number theory
• Solving a linear equation in a set of integers II
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

This page was built for publication: Non-averaging subsets and non-vanishing transversals