Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
From MaRDI portal
Publication:3387113
DOI10.1007/978-3-030-44559-1_13OpenAlexW2935074241MaRDI QIDQ3387113FDOQ3387113
Authors: 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
Cites Work
- Title not available (Why is that?)
- A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
- Title not available (Why is that?)
- On Sets of Acquaintances and Strangers at any Party
- On Schur properties of random subsets of integers
- On the number of monochromatic Schur triples.
- The number of monochromatic Schur triples
- Title not available (Why is that?)
- On the monochromatic Schur triples type problem
- Finding Patterns Avoiding Many Monochromatic Constellations
- On the minimum number of monochromatic generalized Schur triples
Cited In (9)
- Lower bounds on the length of monotone paths in arrangements
- Exact values and lower bounds on the \(n\)-color weak Schur numbers for \(n=2,3\)
- The Mondrian Puzzle: A Bound Concerning the $M(n) = 0$ Case
- The minimal number of monochromatic Schur tuples in a cyclic group
- A lower bound for weak Schur numbers with a deterministic algorithm
- Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
- A Unified Approach to Unimodality of Gaussian Polynomials
- Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
- On the minimum number of monochromatic generalized Schur triples
Uses Software
This page was built for publication: Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387113)
