The following pages link to (Q3313888):
Displaying 42 items.
- Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees (Q274673) (← links)
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs (Q276313) (← links)
- Turán problems on non-uniform hypergraphs (Q470944) (← links)
- Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four (Q663476) (← links)
- An exact result for 3-graphs (Q793054) (← links)
- On set systems with a threshold property (Q856857) (← links)
- Constructions and bounds for \((m,t)\)-splitting systems (Q861791) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
- Lower bounds for Turán's problem (Q1065822) (← links)
- An application of graph theory to additive number theory (Q1068128) (← links)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
- Subset sums (Q1090706) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- A forbidden configuration theorem of Alon (Q1119580) (← links)
- On a Turán type problem of Erdős (Q1180412) (← links)
- An upper bound for the Turán number \(t_3(n,4)\) (Q1304632) (← links)
- Improved bounds on the Hadwiger-Debrunner numbers (Q1650467) (← links)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- What we know and what we do not know about Turán numbers (Q1895823) (← links)
- The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem (Q2033908) (← links)
- A universal exponent for homeomorphs (Q2048857) (← links)
- Hypergraph based Berge hypergraphs (Q2062896) (← links)
- An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets (Q2206734) (← links)
- Covering of subspaces by subspaces (Q2248651) (← links)
- A positive fraction mutually avoiding sets theorem (Q2286590) (← links)
- Matricial characterization of tournaments with maximum number of diamonds (Q2297718) (← links)
- Tournaments, 4-uniform hypergraphs, and an exact extremal result (Q2399352) (← links)
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles (Q2421871) (← links)
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\) (Q2461770) (← links)
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers (Q2483473) (← links)
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) (Q2490871) (← links)
- Codegree Turán Density of Complete $r$-Uniform Hypergraphs (Q4563373) (← links)
- One-Sided Epsilon-Approximants (Q4604378) (← links)
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers (Q4610452) (← links)
- On a problem of Danzer (Q5009631) (← links)
- On a Problem of Danzer (Q5222544) (← links)
- Simplicial homeomorphs and trace-bounded hypergraphs (Q5871268) (← links)
- Independence number of hypergraphs under degree conditions (Q6076735) (← links)
- On Turán numbers for disconnected hypergraphs (Q6111798) (← links)
- Design theory and some forbidden configurations (Q6187433) (← links)
- Unavoidable order-size pairs in hypergraphs -- positive forcing density (Q6204681) (← links)
