Some intersection theorems for ordered sets and graphs
From MaRDI portal
Publication:1109031
DOI10.1016/0097-3165(86)90019-1zbMATH Open0655.05001OpenAlexW2157827214WikidataQ105724487 ScholiaQ105724487MaRDI QIDQ1109031FDOQ1109031
Authors: Fan Chung, Ron Graham, Peter Frankl, James B. Shearer 
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
Recommendations
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Forbidding just one intersection
- Contributions to the geometry of Hamming spaces
- Intersection theorems for systems of finite sets
- Title not available (Why is that?)
- Erdös–Ko–Rado Theorem—22 Years Later
- On a combinatorial conjecture of Erdös
- Title not available (Why is that?)
- Intersection Theorems on Structures
- Some intersection theorems on two-valued functions
- A note on the intersection properties of subsets of integers
- On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem
- Title not available (Why is that?)
Cited In (93)
- A dropping proof of an entropy inequality
- On the number of group-weighted matchings
- Entropy bounds for perfect matchings and Hamiltonian cycles
- Concentration of measure, classification of submeasures, and dynamics of \(L_0\)
- Upper tails for subgraph counts in random graphs
- Ordered graphs and large bi-cliques in intersection graphs of curves
- Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
- Measure concentration and the weak Pinsker property
- Generalized rank functions and an entropy argument
- Anticlusters and intersecting families of subsets
- A tail bound for read-\(k\) families of functions
- The number of independent sets in an irregular graph
- Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018
- Counting dominating sets and related structures in graphs
- More complete intersection theorems
- Lower bounds for linear decision lists
- \(H\)-colouring bipartite graphs
- A geometric theory for hypergraph matching
- Uniform Constraint Satisfaction Problems and Database Theory
- Multicover inequalities on colored complexes
- \(H\)-coloring tori
- Range of cube-indexed random walk
- Proof of a hypercontractive estimate via entropy
- The number of 4-colorings of the Hamming cube
- On the variance of Shannon products of graphs
- Randomly colouring graphs (a combinatorial view)
- Graph-intersecting set systems and LYM inequalities
- A stability result for the cube edge isoperimetric inequality
- Title not available (Why is that?)
- Projections, entropy and sumsets
- A superadditivity and submultiplicativity property for cardinalities of sumsets
- An entropy argument for counting matroids
- Entropy, independent sets and antichains: A new approach to Dedekind's problem
- Entropy and set cardinality inequalities for partition-determined functions
- Counting independent sets in regular hypergraphs
- The number of 2-SAT functions
- On the number of bases of almost all matroids
- Entropy production in nonlinear recombination models
- Sumsets and entropy
- On the Number of Connected Sets in Bounded Degree Graphs
- Comparing graphs of different sizes
- Trimmed Moebius inversion and graphs of bounded degree
- The number of k‐SAT functions
- On the number of connected sets in bounded degree graphs
- On the number of copies of one hypergraph in another
- Families intersecting on an interval
- Some intersection theorems for structures
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Intersection theorems for t-valued functions
- Title not available (Why is that?)
- Generating all subsets of a finite set with disjoint unions
- Geometric stability via information theory
- Some intersection theorems on two-valued functions
- Notes on use of generalized entropies in counting
- Intersecting set systems and graphic matroids
- Enumerating matroids of fixed rank
- Edge colorings of graphs without monochromatic stars
- Representations of families of triples over \(GF(2)\)
- Bounds on the Poincaré constant for convolution measures
- Counting maximal antichains and independent sets
- Properties of intersecting families of ordered sets
- Approximation by juntas in the symmetric group, and forbidden intersection problems
- On lower transcendence degree
- Intersecting families of finite sets and fixed-point-free 2-elements
- A remark on the number of edge colorings of graphs
- Extremal regular graphs: independent sets and graph homomorphisms
- Triangle-intersecting families of graphs
- Upper tails via high moments and entropic stability
- Forbidden intersections for codes
- On sum-intersecting families of positive integers
- Structured Codes of Graphs
- Computing from projections of random points
- Self-similarity bounds for locally thin set families
- A note on Hamiltonian-intersecting families of graphs
- \(K_4\)-intersecting families of graphs
- A note on large \(H\)-intersecting families
- Entropy and expansion
- Sign rank versus Vapnik-Chervonenkis dimension
- Kruskal-Katona-type problems via the entropy method
- On the inequalities of projected volumes and the constructible region
- On a conjecture of Nagy on extremal densities
- Topological drawings meet classical theorems from convex geometry
- Simplified separation of information and communication
- Sparse reconstruction in spin systems. I: iid spins
- Adjoint Brascamp-Lieb inequalities
- The number of 3-SAT functions
- Some intersection theorems for structures
- Multi-variate correlation and mixtures of product measures.
- Inequalities on Projected Volumes
- Rigidity of proper colorings of \(\mathbb{Z}^d \)
- Upper tail bounds for cycles
- Asymptotics for Shamir's problem
- Stability for maximal independent sets
This page was built for publication: Some intersection theorems for ordered sets and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109031)
