scientific article
From MaRDI portal
zbMath0595.05001MaRDI QIDQ3726125
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of partitions of integers (05A17) Hypergraphs (05C65) Permutations, words, matrices (05A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Enumerative combinatorics (05Axx)
Related Items
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem, Lipschitz bijections between boolean functions, The length of an s-increasing sequence of r-tuples, An extension of Elton’s ℓ₁ⁿ theorem to complex Banach spaces, Kirillov's orbit method and polynomiality of the faithful dimension of $p$-groups, Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets, Load balancing in quorum systems, An intersection theorem for four sets, Infinite groups in a given variety and ramsey's theorem, A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs, Edgeworth approximations for distributions of symmetric statistics, Properties of Large 2-Crossing-Critical Graphs, List-decoding Barnes-Wall lattices, Cross-Intersecting Families of Vectors, A comparison of two lower bound methods for communication complexity, Unnamed Item, Derandomized Construction of Combinatorial Batch Codes, Error-correction capability of Reed-Muller codes, From Helgermites to Lipschitz: Remembering Jim Jamison, The width of downsets, The EGH Conjecture and the Sperner property of complete intersections, Two proofs of Bondy's theorem on induced subsets and two related questions, On the metrization of the infinite partition lattice, Solution to a problem of Katona on counting cliques of weighted graphs, Formalising the Kruskal-Katona theorem in Lean, Isoperimetric Problem and Meta-fibonacci Sequences, Drawing Graphs on Few Lines and Few Planes, Unnamed Item, A NOTE ON ANTICHAINS IN THE CONTINUOUS CUBE, Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian, Robust equilibria in tournaments, Deranged Matchings: Proofs and Conjectures, Expander graphs and their applications, Minimising the total number of subsets and supersets, Stability for vertex isoperimetry in the cube, Shadows of ordered graphs, Set Systems Containing Many Maximal Chains, Witnessing differences without redundancies, On the central levels problem, Local Maxima of Quadratic Boolean Functions, An Inequality for Functions on the Hamming Cube, Antichains and completely separating systems -- a catalogue and applications, Tilted Sperner families, Approximately classic judgement aggregation, Long paths and cycles in subgraphs of the cube, Poincaré duality algebras mod two, Forbidding a set difference of size 1, Long geodesics in subgraphs of the cube, Sequential legislative lobbying, Another algebraic proof of Bondy's theorem on induced subsets, Orthogonal Tree Decompositions of Graphs, An AZ-style identity and Bollobás deficiency, Abstract Concept Lattices, On symmetric intersecting families, Aspects of discrete mathematics and probability in the theory of machine learning, On the complexity of constrained VC-classes, Antichain codes, The Littlewood-Offord problem and invertibility of random matrices, On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs, Unnamed Item, Stability versions of Erdős-Ko-Rado type theorems via isoperimetry, Resilience for the Littlewood-Offord problem, The carvingwidth of hypercubes, The toughness of Kneser graphs, A generalization of the Bollobás set pairs inequality, Covering graphs by monochromatic trees and Helly-type results for hypergraphs, On Eulerian orientations of even-degree hypercubes, Testing for Dense Subsets in a Graph via the Partition Function, Uniqueness in Harper's vertex-isoperimetric theorem, Vertex-isoperimetric stability in the hypercube, The EKR property for flag pure simplicial complexes without boundary, On the union of intersecting families, On the VC-dimension and boolean functions with long runs, Projections of antichains, Unnamed Item, Bollobás-type theorems for hemi-bundled two families, Gray codes and symmetric chains, Unnamed Item, A geometric theory for hypergraph matching, Covering minimum spanning trees of random subgraphs, Integer cells in convex sets, The enumerability of P collapses P to NC, Consensus on simplicial complexes: Results on stability and synchronization, Lower bounds for boxicity, Cross-intersecting families of vectors, A linear bound on the Manickam-Miklós-Singhi conjecture, Forbidding intersection patterns between layers of the cube, Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors, A correlation inequality for connection events in percolation, Optimal coteries and voting schemes, Intersection problems in the \(q\)-ary cube, Icosahedral group and classification of \(\mathrm{PSL}(2, Z)\)-orbits of real quadratic fields, Stability theorems for cancellative hypergraphs, A problem of Shapozenko on Johnson graphs, Multicoloured extremal problems, A problem of Füredi and Seymour on covering intersecting families by pairs, Embeddings and the trace of finite sets, Coding techniques for handling failures in large disk arrays, Graph-theoretic design and analysis of key predistribution schemes, Extremal problems for the Möbius function in the face lattice of the \(n\)-octahedron, Complexity aspects of generalized Helly hypergraphs, An improved lower bound for approximating shortest integer relation in \(\ell _{\infty }\) norm \((SIR_{\infty })\), A comparison of two lower-bound methods for communication complexity, Towards characterizing equality in correlation inequalities, On specifying Boolean functions by labelled examples, The maximum determinant of \(\pm 1\) matrices, Equidistant families of sets, Critical point theory of symmetric functions and closed geodesics, The hardness of approximate optima in lattices, codes, and systems of linear equations, Cross-intersecting families of finite sets, A generalized Macaulay theorem and generalized face rings, On a restricted cross-intersection problem, On set systems with a threshold property, Witness sets for families of binary vectors, Matchings and paths in the cube, On neighborhood-Helly graphs, A generalized FKG-inequality for compositions, Some greedy \(t\)-intersecting families of finite sequences, A class of primary Banach spaces, Key storage in secure networks, Patterns and invasions of evolutionarily stable strategies, Long cycles in the middle two layers of the discrete cube, On minimum saturated matrices, Simple polytopes without small separators, On half-way AZ-style identities, An approximate vertex-isoperimetric inequality for \(r\)-sets, On a problem of Erdős and Moser, Any network code comes from an algebraic curve taking osculating spaces, On saturated \(k\)-Sperner systems, A stability result for the cube edge isoperimetric inequality, A LYM inequality for induced posets, Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere, Parallel multilevel algorithms for hypergraph partitioning, Isoperimetric inequalities for faces of the cube and the grid, Exact face-isoperimetric inequalities, Events correlated with respect to every subposet of a fixed poset, On homomorphisms from the Hamming cube to \(\mathbb{Z}\), An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)), Set systems: order types, continuous nondeterministic deformations, and quasi-orders, A lower bound for radio broadcast, Efficient \(q\)-ary immutable codes, Edge-isoperimetric inequalities in the grid, Threshold functions for local properties of graphs: Triangles, Graphs with least eigenvalue \(-2\): ten years on, On a small class of Boolean sums, An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm, Learning Boolean logic models of signaling networks with ASP, Number theoretic correlation inequalities for Dirichlet densities, Constrained versions of Sauer's Lemma, Computing marginals using MapReduce, Tight cycles and regular slices in dense hypergraphs, On the connection of hypergraph theory with formal concept analysis and rough set theory, Set families with a forbidden pattern, Hypergraph saturation irregularities, Strongly connected multivariate digraphs, Correlation in partially ordered sets, How to deal with unbelievable assertions, Helly property in finite set systems, Erdős-Ko-Rado with conditions on the minimum complementary degree, Invitation to intersection problems for finite sets, The influence of variables in product spaces, Bounds on isoperimetric values of trees, Extremal problems for linear orders on \([n^ p\)], An ``average distance inequality for large subsets of the cube, Linear CNF formulas and satisfiability, On the complexity of binary samples, Uniqueness of unconditional bases in Banach spaces, Stable sets of maximal size in Kneser-type graphs, On the number of almost envy-free allocations, A new lower bound for the bipartite crossing number with applications, On decompositions of complete hypergraphs, Correlation for permutations, Min-wise independent permutations, Linear transformations of monotone functions on the discrete cube, \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids, A short proof of a cross-intersection theorem of Hilton, The Vapnik-Chervonenkis dimension of a random graph, A note on the influence of an \(\epsilon\)-biased random source, Heuristic testing procedures for general coherent systems, Combinatorics and connectionism, Maximal sets of given diameter in the grid and the torus, Extremal problems whose solutions are the blowups of the small Witt- designs, Compressions and isoperimetric inequalities, Hyperplane sections of Grassmannians and the number of MDS linear codes, On approximate \(\ell_1\) systems in Banach spaces, The width of random subsets of Boolean lattices, Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard, Determinism versus nondeterminism for linear time RAMs with memory restrictions
