On the existence of triangulated spheres in 3-graphs, and related problems
The problem described in the title represents an analogue of the well known property of graphs that any graph on \(n\) vertices and having at least \(n\) edges contains a polygon. That result could be restated, in topological terms, as saying that any simplicial 1-complex with at least as many 1-simplexes as 0-simplexes must contain a triangulation of the 1-sphere. In Theorem 3 we shall determine asymptotically the maximum number of 2-simplexes a simplicial 2-complex may contain without containing a subcomplex which is a triangulation of the 2-sphere. More precisely, we shall prove that there exist constants \(c_1\) and \(c_2\) such that every 3-graph on \(n\) vertices having \(c_2n^{3/2}\) edges or more contains a double pyramid; but that there exists a 3-graph on \(n\) vertices having \(c_1n^{3/2}\) edges containing no triangulation of the sphere. Also, we discuss several related results.
- A Theorem in Finite Projective Geometry and Some Applications to Number Theory
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- Minimal coverings of pairs by triples
- On coloring graphs to maximize the proportion of multicolored k-edges
- On extremal problems of graphs and generalized graphs
- On Graphs that do not Contain a Thomsen Graph
- On maximal paths and circuits of graphs
- On some extremal problems on r-graphs
- On the structure of linear graphs
- On the theory of graphs
- Many triangulated spheres
- Exact solution of some Turán-type problems
- On the combinatorial problems which I would most like to see solved
- A variant of the classical Ramsey problem
- Induced subgraphs of given sizes
- 2-complexes with large 2-girth
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- A universal exponent for homeomorphs
- Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs
- A new bound for the Brown-Erdős-Sós problem
- A linear hypergraph extension of Turán's theorem
- Spanning surfaces in \(3\)-graphs
- A linear hypergraph extension of the bipartite Turán problem
- Alexander ideals of graphs in the 3-sphere
- Degenerate Turán densities of sparse hypergraphs
- The Brown-Erdős-Sós conjecture in finite abelian groups
- Turán numbers and batch codes
- Deciding nonconstructibility of 3-balls with spanning edges and interior vertices
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
- 2-cancellative hypergraphs and codes
- Turán problems for integer-weighted graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 5116037 (Why is no real title available?)
- Small cores in 3-uniform hypergraphs
- Uniform hypergraphs containing no grids
- On the Maximum Number of Triangles in Wheel-Free Graphs
- An application of the regularity lemma in generalized Ramsey theory
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Proof of the Brown-Erdős-Sós conjecture in groups
- On 2-skeleta of Platonic polytopes
- Supersaturation of even linear cycles in linear hypergraphs
- A Ramsey variant of the Brown-Erdős-Sós conjecture
- The extremal number of surfaces
- Sparse hypergraphs with applications to coding theory
- Constructing dense grid-free linear 3-graphs
- Triple systems with no three triples spanning at most five points
- Separating hash families: a Johnson-type bound and new constructions
- The (7, 4)-Conjecture in Finite Groups
- scientific article; zbMATH DE number 6260075 (Why is no real title available?)
- The existence of triangles, tetrahedra, and higher-dimensional simplices with prescribed exradii
- Simplicial homeomorphs and trace-bounded hypergraphs
- The regularity method for graphs with few 4‐cycles
- Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
- Deciding constructibility of 3-balls with at most two interior vertices
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
- Existence of the map \(det^{S^3}\)
- Local-vs-global combinatorics
- The fine structure of octahedron-free graphs
- Euler's theorem for regular CW-complexes
- Linear saturation numbers of Berge-C₃ and Berge-C₄
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- On the structure of pointsets with many collinear triples
- Turán numbers and switching
- The Turán number of surfaces
- On the spectral Turán problems for bipartite hypergraphs
- On the existence of a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope with a prescribed set of vertices
- A conditional lower bound for the Turán number of spheres
- On Turán problems for suspension hypergraphs
- A new approach for the Brown-Erdős-Sós problem
- A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
- A new approach for the Brown-Erdős-Sós problem (extended abstract)
- The Turán number of surfaces (extended abstract)
- An improved Turán exponent for 2-complexes
- Two extremal problems in linear hypergraphs
- On the ( k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7
- On the existence of dense substructures in finite groups
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- Generalizations of the removal lemma
This page was built for publication: On the existence of triangulated spheres in 3-graphs, and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563170)
