Some intersection theorems for ordered sets and graphs
From MaRDI portal
Publication:1109031
DOI10.1016/0097-3165(86)90019-1zbMath0655.05001OpenAlexW2157827214WikidataQ105724487 ScholiaQ105724487MaRDI QIDQ1109031
Peter Frankl, Ronald L. Graham, James B. Shearer, Fan R. K. Chung
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(86)90019-1
Related Items
Structured Codes of Graphs, Counting dominating sets and related structures in graphs, More complete intersection theorems, Concentration of measure, classification of submeasures, and dynamics of \(L_0\), Upper tails for subgraph counts in random graphs, A remark on the number of edge colorings of graphs, On the number of connected sets in bounded degree graphs, Counting maximal antichains and independent sets, Entropy and set cardinality inequalities for partition-determined functions, The number of k‐SAT functions, Intersecting families of finite sets and fixed-point-free 2-elements, Anticlusters and intersecting families of subsets, Some intersection theorems on two-valued functions, A tail bound for read-kfamilies of functions, Upper tails via high moments and entropic stability, Extremal Regular Graphs: Independent Sets and Graph Homomorphisms, Bounds on the Poincaré constant for convolution measures, On the number of group-weighted matchings, On the Number of Connected Sets in Bounded Degree Graphs, The number of 4-colorings of the Hamming cube, Approximation by juntas in the symmetric group, and forbidden intersection problems, Unnamed Item, \(K_4\)-intersecting families of graphs, Topological drawings meet classical theorems from convex geometry, A stability result for the cube edge isoperimetric inequality, The number of 3-SAT functions, Entropy bounds for perfect matchings and Hamiltonian cycles, \(H\)-colouring bipartite graphs, Forbidden intersections for codes, Triangle-intersecting families of graphs, Rigidity of proper colorings of \(\mathbb{Z}^d \), Computing from projections of random points, Comparing Graphs of Different Sizes, Sign rank versus Vapnik-Chervonenkis dimension, Multi-variate correlation and mixtures of product measures, Generating all subsets of a finite set with disjoint unions, Asymptotics for Shamir's problem, On the Inequalities of Projected Volumes and the Constructible Region, Projections, entropy and sumsets, Trimmed Moebius inversion and graphs of bounded degree, Intersection theorems for t-valued functions, Upper Tail Bounds for Cycles, Randomly colouring graphs (a combinatorial view), Measure concentration and the weak Pinsker property, An entropy argument for counting matroids, A superadditivity and submultiplicativity property for cardinalities of sumsets, A Note on Large H-Intersecting Families, Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018, Counting independent sets in regular hypergraphs, On the variance of Shannon products of graphs, Notes on use of generalized entropies in counting, Multicover inequalities on colored complexes, Enumerating matroids of fixed rank, Entropy production in nonlinear recombination models, A dropping proof of an entropy inequality, Entropy, independent sets and antichains: A new approach to Dedekind’s problem, Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence, Edge colorings of graphs without monochromatic stars, \(H\)-coloring tori, Range of cube-indexed random walk, Proof of a hypercontractive estimate via entropy, On the number of bases of almost all matroids, Entropy and expansion, Sumsets and entropy, Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number, On the number of copies of one hypergraph in another, Representations of families of triples over \(GF(2)\), Stability for maximal independent sets, Geometric stability via information theory, On lower transcendence degree, The number of independent sets in an irregular graph, Unnamed Item, A geometric theory for hypergraph matching, Families intersecting on an interval, Intersecting set systems and graphic matroids, Uniform Constraint Satisfaction Problems and Database Theory, On a Conjecture of Nagy on Extremal Densities, Inequalities on Projected Volumes, Generalized rank functions and an entropy argument, The number of 2-SAT functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forbidding just one intersection
- Some intersection theorems on two-valued functions
- A note on the intersection properties of subsets of integers
- Contributions to the geometry of Hamming spaces
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem
- Intersection Theorems on Structures
- Intersection theorems for systems of finite sets
- On a combinatorial conjecture of Erdös
