scientific article
From MaRDI portal
Publication:3313888
zbMath0532.05037MaRDI QIDQ3313888
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (42)
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent ⋮ Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees ⋮ Connection between the clique number and the Lagrangian of 3-uniform hypergraphs ⋮ Subset sums ⋮ What we know and what we do not know about Turán numbers ⋮ Improved bounds on the Hadwiger-Debrunner numbers ⋮ On set systems with a threshold property ⋮ Constructions and bounds for \((m,t)\)-splitting systems ⋮ Exact solution of some Turán-type problems ⋮ Codegree Turán Density of Complete $r$-Uniform Hypergraphs ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ A forbidden configuration theorem of Alon ⋮ Simplicial homeomorphs and trace-bounded hypergraphs ⋮ Independence number of hypergraphs under degree conditions ⋮ \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles ⋮ On Turán numbers for disconnected hypergraphs ⋮ Design theory and some forbidden configurations ⋮ Unavoidable order-size pairs in hypergraphs -- positive forcing density ⋮ One-Sided Epsilon-Approximants ⋮ Galois geometries and coding theory ⋮ An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Turán problems on non-uniform hypergraphs ⋮ Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four ⋮ On a Turán type problem of Erdős ⋮ Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\) ⋮ Covering of subspaces by subspaces ⋮ 3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) ⋮ On a problem of Danzer ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem ⋮ A positive fraction mutually avoiding sets theorem ⋮ Bounds on the sizes of constant weight covering codes ⋮ Matricial characterization of tournaments with maximum number of diamonds ⋮ A universal exponent for homeomorphs ⋮ On a Problem of Danzer ⋮ A generalization of the Motzkin-Straus theorem to hypergraphs ⋮ Hypergraph based Berge hypergraphs ⋮ An exact result for 3-graphs ⋮ An upper bound for the Turán number \(t_3(n,4)\) ⋮ Lower bounds for Turán's problem ⋮ An application of graph theory to additive number theory
This page was built for publication:
