The Rado multiplicity problem in vector spaces over finite fields

DOI10.1016/J.FFA.2025.102782MaRDI QIDQ6868404zbMATH OpenFDO

Authors Juanjo Rué, Christoph Spiegel

Publication date 26 January 2026

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.FFA.2025.102782

zbMATH Keywords

arithmetic progressionscombinatorial number theoryflag algebrasRamsey theory

Mathematics Subject Classification ID

Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites work

• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• A note on the inducibility of 4-vertex graphs
• A problem of Erdős on the minimum number of k-cliques
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• Common and Sidorenko linear equations
• Common systems of two equations over the binary field
• CSDP, A C library for semidefinite programming
• Flag algebras
• Flag Algebras: A First Glance
• Graph products and monochromatic multiplicities
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Hypergraphs do jump
• Isomorph-Free Exhaustive Generation
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Monochromatic 4-term arithmetic progressions in 2-colorings of Z_n
• Monochromatic triangles in three-coloured graphs
• New Ramsey multiplicity bounds and search heuristics
• On 3-hypergraphs with forbidden 4-vertex configurations
• On monochromatic solutions of equations in groups
• On Schur properties of random subsets of integers
• On Sets of Acquaintances and Strangers at any Party
• On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
• On the maximum number of five-cycles in a triangle-free graph
• On the minimum number of k-cliques in graphs with restricted independence number
• On the number of monochromatic Schur triples.
• Practical graph isomorphism. II.
• Rainbow triangles in three-colored graphs
• Ramsey multiplicity of linear patterns in certain finite abelian groups
• Semidefinite programming and Ramsey numbers
• Studien zur Kombinatorik
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• The minimum number of monochromatic 4-term progressions in Z_p
• The number of monochromatic Schur triples
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

Cited in

(1)

• An unsure note on an un-Schur problem

This page was built for publication: The Rado multiplicity problem in vector spaces over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6868404)