Saturation problems in convex geometric hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3896968 (Why is no real title available?)
- scientific article; zbMATH DE number 1342089 (Why is no real title available?)
- scientific article; zbMATH DE number 2145227 (Why is no real title available?)
- A Problem in Graph Theory
- A Turán-type theorem on chords of a convex polygon
- A survey of minimum saturated graphs
- Colored saturation parameters for rainbow subgraphs
- Extremal problems for pairs of triangles
- Extremal theory for convex matchings in convex geometric graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- More Turán-type theorems for triangles in convex point sets
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges
- On edge-colored saturation problems
- On generalized graphs
- On maximal intersecting families of finite sets
- Ordered and convex geometric trees with linear extremal function
- Rainbow saturation and graph capacities
- Rainbow saturation of graphs
- The Minimum Size of Saturated Hypergraphs
- The beginnings of geometric graph theory
- Tight paths in convex geometric hypergraphs
Cited in
(5)
This page was built for publication: Saturation problems in convex geometric hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701003)
