The (7, 4)-Conjecture in Finite Groups

DOI10.1017/S0963548314000856zbMath1371.05302arXiv1309.0133OpenAlexW2962708073WikidataQ122958159 ScholiaQ122958159MaRDI QIDQ5364251

József Solymosi

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Extremal set theory (05D05)

Related Items (9)

Small cores in 3-uniform hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Proof of the Brown–Erdős–Sós conjecture in groups ⋮ Large girth approximate Steiner triple systems ⋮ The Brown-Erdős-Sós conjecture in finite abelian groups ⋮ A note on the Brown–Erdős–Sós conjecture in groups ⋮ On the existence of dense substructures in finite groups ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ A Ramsey variant of the Brown–Erdős–Sós conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 6-sparse Steiner triple systems
• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Roth-type theorems in finite groups
• On the existence of triangulated spheres in 3-graphs, and related problems
• Small latin squares, quasigroups, and loops
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Extremal problems on set systems
• Regularity Lemma for k-uniform hypergraphs
• A Note on a Question of Erdős and Graham
• The counting lemma for regular k‐uniform hypergraphs

This page was built for publication: The (7, 4)-Conjecture in Finite Groups