Exact Lower Bounds for Monochromatic Schur Triples and Generalizations

DOI10.1007/978-3-030-44559-1_13OpenAlexW2935074241MaRDI QIDQ3387113

Christoph Koutschan, Elaine Wong

Publication date: 12 January 2021

Published in: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

A Unified Approach to Unimodality of Gaussian Polynomials

Uses Software

• OEIS
• RON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum number of monochromatic generalized Schur triples
• On the monochromatic Schur triples type problem
• On Schur properties of random subsets of integers
• A 2-coloring of \([1, N\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less]
• On the number of monochromatic Schur triples.
• The number of monochromatic Schur triples
• Finding Patterns Avoiding Many Monochromatic Constellations
• On Sets of Acquaintances and Strangers at any Party

This page was built for publication: Exact Lower Bounds for Monochromatic Schur Triples and Generalizations