On finite set-systems whose every intersection is a kernel of a star
From MaRDI portal
Publication:787982
DOI10.1016/0012-365X(83)90081-XzbMath0531.05002OpenAlexW2090746613MaRDI QIDQ787982
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(83)90081-x
Related Items
Hypergraphs without non-trivial intersecting subgraphs, All rationals occur as exponents, An \(L\)-system on the small Witt design, Some Results on Chromaticity of Quasilinear Hypergraphs, On generalized Turán number of two disjoint cliques, Exact solution of some Turán-type problems, Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths, Extremal Problems for Hypergraph Blowups of Trees, Intersecting families with sunflower shadows, On t-Intersecting Hypergraphs with Minimum Positive Codegrees, Improved bounds on the maximum diversity of intersecting families, Hypergraph Turán numbers of linear cycles, Unavoidable subhypergraphs: \(\mathbf a\)-clusters, Almost-Fisher families, Extremal set systems with restricted \(k\)-wise intersections., Non-trivial \(d\)-wise intersecting families, Ryser's conjecture for \(t\)-intersecting hypergraphs, Almost-Fisher families, Some structural properties of low-rank matrices related to computational complexity, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Unavoidable hypergraphs, Hypergraphs with pendant paths are not chromatically unique, Forbidding complete hypergraphs as traces, Characterising bimodal collections of sets in finite groups, A note on a conjecture by Füredi, On a conjecture of Thomassen concerning subgraphs of large girth, Linear trees in uniform hypergraphs, Invitation to intersection problems for finite sets, Bounds on the Maximum Number of Vectors with given Scalar Products, Dense Induced Subgraphs of Dense Bipartite Graphs, Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree, Unavoidable subhypergraphs: a-clusters, Set systems with three intersections, Forbidding just one intersection, On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Families of finite sets with three intersections
- On set intersections
- A finite set intersection theorem
- On the combinatorial problems which I would most like to see solved
- Intersection Theorems for Systems of Sets
- Families of finite sets with prescribed cardinalities for pairwise intersections
- On coloring graphs to maximize the proportion of multicolored k-edges
