On the existence of triangulated spheres in 3-graphs, and related problems

DOI10.1007/BF02018585zbMath0269.05111OpenAlexW2143569998WikidataQ106010266 ScholiaQ106010266MaRDI QIDQ2563170

Paul Erdős, Vera T. Sós, William G. Brown

Publication date: 1973

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02018585

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Spanning surfaces in \(3\)-graphs, 2-Cancellative Hypergraphs and Codes, Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques, Separating Hash Families: A Johnson-type bound and New Constructions, Small cores in 3-uniform hypergraphs, Exact solution of some Turán-type problems, Unnamed Item, Simplicial homeomorphs and trace-bounded hypergraphs, On the Maximum Number of Triangles in Wheel-Free Graphs, Uniform hypergraphs containing no grids, 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}\), The fine structure of octahedron-free graphs, Local-vs-global combinatorics, The (7, 4)-Conjecture in Finite Groups, 2-complexes with large 2-girth, Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs, On the combinatorial problems which I would most like to see solved, Sparse Hypergraphs with Applications to Coding Theory, A linear hypergraph extension of the bipartite Turán problem, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers, Constructing dense grid-free linear $3$-graphs, Generalizations of the removal lemma, An application of the regularity lemma in generalized Ramsey theory, Proof of the Brown–Erdős–Sós conjecture in groups, A universal exponent for homeomorphs, Degenerate Turán densities of sparse hypergraphs, The Brown-Erdős-Sós conjecture in finite abelian groups, Triple systems with no three triples spanning at most five points, A variant of the classical Ramsey problem, Supersaturation of even linear cycles in linear hypergraphs, On a Turán-type hypergraph problem of Brown, Erdős and T. Sós, On the existence of dense substructures in finite groups, Induced subgraphs of given sizes, Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs, Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures, A new bound for the Brown-Erdős-Sós problem, Turán numbers and batch codes, A Ramsey variant of the Brown–Erdős–Sós conjecture, A linear hypergraph extension of Turán's theorem, The regularity method for graphs with few 4‐cycles, Turán problems for integer-weighted graphs

Cites Work

• Unnamed Item
• Minimal coverings of pairs by triples
• On extremal problems of graphs and generalized graphs
• On some extremal problems on \(r\)-graphs
• On maximal paths and circuits of graphs
• On coloring graphs to maximize the proportion of multicolored k-edges
• On Graphs that do not Contain a Thomsen Graph
• A Theorem in Finite Projective Geometry and Some Applications to Number Theory
• On the theory of graphs
• On the structure of linear graphs