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 ⋮ Log-Sobolev inequality for the multislice, with applications ⋮ Treewidth of the generalized Kneser graphs ⋮ The maximum product of sizes of cross-intersecting families ⋮ Internally perfect matroids ⋮ Union of shadows ⋮ Practical sequential bounds for approximating two-terminal reliability ⋮ On the extremal combinatorics of the Hamming space ⋮ The lex-plus-powers inequality for local cohomology modules ⋮ Multiply-intersecting families revisited ⋮ Cross-intersecting families of finite sets ⋮ On the rank of higher inclusion matrices ⋮ Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs ⋮ The poset on connected graphs is Sperner ⋮ Upper tails via high moments and entropic stability ⋮ The maximum sum of sizes of cross-intersecting families of subsets of a set ⋮ A path forward: tropicalization in extremal combinatorics ⋮ On intersecting families of independent sets in trees ⋮ Almost intersecting families ⋮ Minimum weight flat antichains of subsets ⋮ On the distance of databases ⋮ Homomorphisms into loop-threshold graphs ⋮ On the maximum number of edges in hypergraphs with fixed matching and clique number ⋮ The Kruskal-Katona Theorem and a Characterization of System Signatures ⋮ Structure and supersaturation for intersecting families ⋮ Many triangles with few edges ⋮ Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors ⋮ Regular bipartite graphs and intersecting families ⋮ On \(f\)- and \(h\)-vectors of relative simplicial complexes ⋮ The width of downsets ⋮ Macaulay's theorem for some projective monomial curves ⋮ \(f\)-vectors implying vertex decomposability ⋮ Poset embeddings of Hilbert functions for two hypersurface rings ⋮ Stability for vertex isoperimetry in the cube ⋮ Shadows of ordered graphs ⋮ The maximum number of complete subgraphs in a graph with given maximum degree ⋮ Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas ⋮ Stability theorems for some Kruskal-Katona type results ⋮ Shadow ratio of hypergraphs with bounded degree
This page was built for publication:
