SCHUR’S COLOURING THEOREM FOR NONCOMMUTING PAIRS

DOI10.1017/S0004972719000406zbMath1469.20065arXiv1901.01738WikidataQ128073738 ScholiaQ128073738MaRDI QIDQ5244203

Tom Sanders

Publication date: 20 November 2019

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

commuting probabilitynon-abelian groupSchur's colouring theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Probabilistic methods in group theory (20P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the sum of two sets in a group
• A new proof of the graph removal lemma
• A variant of the hypergraph removal lemma
• Multiple recurrence in quasirandom groups
• Roth-type theorems in finite groups
• Limit points in the range of the commuting probability function on finite groups
• Ajtai–Szemerédi Theorems over quasirandom groups
• Solvingxz=y²in Certain Subsets of Finite Groups
• Commuting probabilities of finite groups
• ON A GENERALIZATION OF SZEMERÉDI'S THEOREM
• Two Combinatorial Problems in Group Theory
• Quasirandom Groups
• On a two-dimensional analogue of Szemerédi's theorem in Abelian groups
• Sums of sets of group elements
• A Roth theorem for amenable groups.
• What is the Probability that Two Group Elements Commute?
• Monochromatic Permutation Quadruples—A Schur Thing in <em>S_n</em>
• On a problem of Gowers