scientific article; zbMATH DE number 3189757
From MaRDI portal
Publication:5726070
zbMath0116.35102MaRDI QIDQ5726070
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ Rainbow version of the Erdős Matching Conjecture via concentration ⋮ Hypergraphs without non-trivial intersecting subgraphs ⋮ Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition ⋮ Unnamed Item ⋮ The Eisenbud-Green-Harris Conjecture ⋮ Unnamed Item ⋮ Polytopes, graphs, and complexes ⋮ Balanced Cohen-Macaulay Complexes ⋮ Hereditary quasirandomness without regularity ⋮ Tropicalization of graph profiles ⋮ The maximum number of triangles in a graph and its relation to the size of the Schur multiplier of special p-groups ⋮ Generalized Turán results for intersecting cliques ⋮ A refined result on cross-intersecting families ⋮ The Profile Polytope of Nontrivial Intersecting Families ⋮ Biased random k‐SAT ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Network reliability: Heading out on the highway ⋮ r$r$‐Cross t$t$‐intersecting families via necessary intersection points ⋮ On t-Intersecting Hypergraphs with Minimum Positive Codegrees ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ Syzygies over a polynomial ring ⋮ A 2-stable family of triple systems ⋮ A product version of the Hilton-Milner theorem ⋮ The saturation spectrum for antichains of subsets ⋮ Intersecting families of sets are typically trivial ⋮ A product version of the Hilton-Milner-Frankl theorem ⋮ Non-trivial \(r\)-wise intersecting families ⋮ A Kruskal-Katona-type theorem for graphs: \(q\)-Kneser graphs ⋮ Many Cliques in Bounded-Degree Hypergraphs ⋮ Vector sum-intersection theorems ⋮ Counting Intersecting and Pairs of Cross-Intersecting Families ⋮ A note on the maximum product-size of non-trivial cross \(t\)-intersecting families ⋮ On the limit of the positive \(\ell\)-degree Turán problem ⋮ Prominent examples of flip processes ⋮ Minimising the total number of subsets and supersets ⋮ Improved bounds on the maximum diversity of intersecting families ⋮ Maximizing the Number of Independent Sets of a Fixed Size ⋮ Sperner's Problem forG-Independent Families ⋮ Partial Shadows of Set Systems ⋮ A Stability Result for the Union-Closed Size Problem ⋮ On the Lower Tail Variational Problem for Random Graphs ⋮ Small Union with Large Set of Centers ⋮ Newton Complementary Duals of -Ideals ⋮ Sets of Lattice Points which Contain a Maximal Number of Edges ⋮ Diversity ⋮ An Erdős-Ko-Rado theorem for multisets ⋮ A construction of two-dimensional Buchsbaum simplicial complexes ⋮ Nonexistence of a Kruskal–Katona type theorem for double-sided shadow minimization in the Boolean cube layer ⋮ Connectedness of Hilbert schemes ⋮ Modularity of some distance graphs ⋮ Unnamed Item ⋮ Shellable complexes from multicomplexes ⋮ Simple juntas for shifted families ⋮ On Erdős–Ko–Rado for Random Hypergraphs II ⋮ Traces of hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the 3‐Local Profiles of Graphs ⋮ On the Eisenbud-Green-Harris conjecture ⋮ A cross‐intersection theorem for subsets of a set ⋮ The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and 𝑚 𝑛-bonds ⋮ Intersection problems in the \(q\)-ary cube ⋮ Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions ⋮ A problem of Shapozenko on Johnson graphs ⋮ A combinatorial decomposition of simplicial complexes ⋮ An extremal problem for antichains of subsets of a multiset ⋮ Another generalization of the Kruskal-Katona theorem ⋮ Intersecting families in \(\begin{pmatrix}[m\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)] ⋮ Minimum shadows in uniform hypergraphs and a generalization of the Takagi function ⋮ Heawood inequalities ⋮ Hilbert functions over toric rings ⋮ Open problems on syzygies and Hilbert functions ⋮ Results on the Wiener profile ⋮ On a problem of Yuzvinsky on separating the n-cube ⋮ Gotzmann theorems for exterior algebras and combinatorics ⋮ The cubical poset is additive ⋮ Decompositions of hypergraphs into hyperstars ⋮ On multiset k-families ⋮ A stability result for the Katona theorem ⋮ Erdős-Ko-Rado theorem with conditions on the maximal degree ⋮ Exact solution of some Turán-type problems ⋮ Multicomplexes and polynomials with real zeros ⋮ Lower bounds on two-terminal network reliability ⋮ A generalization of the Katona theorem for cross t-intersecting families ⋮ A lower bound on the size of a complex generated by an antichain ⋮ Shuffle-compatible total orders ⋮ Diversity of uniform intersecting families ⋮ EKR type inequalities for 4-wise intersecting families ⋮ Gotzmann squarefree ideals ⋮ Minimizing the weight of ideals in a layer of the Boolean cube ⋮ General graph pebbling ⋮ A Hilton-Milner-type theorem and an intersection conjecture for signed sets ⋮ A Kruskal-Katona type theorem for integer partitions ⋮ Some results on Sperner families ⋮ \(f\)-vectors of pure complexes and pure multicomplexes of rank three ⋮ A short proof of an Erdős-Ko-Rado theorem for compositions ⋮ Poset embeddings of Hilbert functions and Betti numbers ⋮ On a problem of Erdős and Moser ⋮ Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
This page was built for publication:
