Forbidding just one intersection
From MaRDI portal
Publication:1062676
DOI10.1016/0097-3165(85)90035-4zbMath0573.05001OpenAlexW2111368375MaRDI QIDQ1062676
Publication date: 1985
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(85)90035-4
Related Items
Hypergraphs without non-trivial intersecting subgraphs, All rationals occur as exponents, Codes with given distances, The maximum number of edges in a 3-graph not containing a given star, Turán numbers of sunflowers, An intersection theorem for four sets, Pairwise intersections and forbidden configurations, Independence numbers of random subgraphs of distance graphs, On the minimal number of edges in induced subgraphs of special distance graphs, Some intersection theorems for ordered sets and graphs, Exact solution of some Turán-type problems, A tale of stars and cliques, Approximation by juntas in the symmetric group, and forbidden intersection problems, Independent sets in hypergraphs omitting an intersection, Generalized Turán results for intersecting cliques, Extremal Problems for Hypergraph Blowups of Trees, Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs, Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version, On the number of edges of a uniform hypergraph with a range of allowed intersections, Integer sequences without singleton intersection, Independence numbers of Johnson-type graphs, Distributed broadcast in radio networks of unknown topology., Forbidden intersections for codes, A short note on supersaturation for oddtown and eventown, Lower bound on the minimum number of edges in subgraphs of Johnson graphs, Graph-codes, Scalable wake-up of multi-channel single-hop radio networks, Unavoidable subhypergraphs: \(\mathbf a\)-clusters, Forbidding a set difference of size 1, Forbidding just one intersection, for permutations, Communication and location discovery in geometric ring networks, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness, Unavoidable hypergraphs, On the stability of some Erdős-Ko-Rado type results, Estimate of the number of edges in subgraphs of a Johnson graph, Set families with a forbidden pattern, Disjoint pairs in set systems with restricted intersection, Forbidden Intersections, Uniformly cross intersecting families, On threshold probability for the stability of independent sets in distance graphs, Linear trees in uniform hypergraphs, The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices, Invitation to intersection problems for finite sets, Chromatic numbers of Kneser-type graphs, Hypergraphs without exponents, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, New Turán type bounds for Johnson graphs, Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs, On the chromatic number of random subgraphs of a certain distance graph, Paths in Hypergraphs: A Rescaling Phenomenon, Unavoidable subhypergraphs: a-clusters, Specified intersections, Intersection theorems for vector spaces, Spectrum of Johnson graphs, Independence numbers and chromatic numbers of some distance graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On hypergraphs without two edges intersecting in a given number of vertices
- On finite set-systems whose every intersection is a kernel of a star
- Linear dependencies among subsets of a finite set
- An extremal set theoretical characterization of some Steiner systems
- A new short proof for the Kruskal-Katona theorem
- Extremal problems and coverings of the space
- On the combinatorial problems which I would most like to see solved
- Intersection theorems with geometric consequences
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Extremal problems for finite sets and convex hulls---a survey
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On families of finite sets no two of which intersect in a singleton
- Intersection Properties of Systems of Finite Sets
- Intersection theorems for systems of finite sets
