Tight paths in convex geometric hypergraphs
From MaRDI portal
Publication:5126752
Abstract: In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz [12], Sutherland [19], Kupitz and Perles [16] for convex geometric graphs, as well as the classical ErdH{o}s-Gallai Theorem [6] for graphs. As a consequence, we obtain the first substantial improvement on the Tur'an problem for tight paths in uniform hypergraphs.
Recommendations
- scientific article; zbMATH DE number 2068176
- On triangle path convexity in graphs
- scientific article; zbMATH DE number 1539533
- Convex geometries over induced paths with bounded length
- Geodesic Convexity in Graphs
- Convexity in Graphs and Hypergraphs
- Convexities related to path properties on graphs
- Tight cycles in hypergraphs
- Geometric Secluded Paths and Planar Satisfiability
- CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
Cited in
(13)- A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
- Extremal Problems for Hypergraph Blowups of Trees
- Saturation problems in convex geometric hypergraphs
- CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
- Extremal problems for pairs of triangles
- Dirac-type conditions for spanning bounded-degree hypertrees
- On extremal hypergraphs for forests of tight paths
- Partitioning ordered hypergraphs
- Extremal problems for convex geometric hypergraphs and ordered hypergraphs
- Turán numbers of ordered tight hyperpaths
- Hypergraphs not containing a tight tree with a bounded trunk
- On tight cycles in hypergraphs
- scientific article; zbMATH DE number 2145227 (Why is no real title available?)
This page was built for publication: Tight paths in convex geometric hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5126752)
