On finite set-systems whose every intersection is a kernel of a star
From MaRDI portal
Publication:787982
DOI10.1016/0012-365X(83)90081-XzbMATH Open0531.05002OpenAlexW2090746613MaRDI QIDQ787982FDOQ787982
Authors: Zoltán Füredi 
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
Recommendations
Cites Work
- On the combinatorial problems which I would most like to see solved
- Intersection Theorems for Systems of Sets
- On coloring graphs to maximize the proportion of multicolored k-edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- A finite set intersection theorem
- On set intersections
- Title not available (Why is that?)
- Families of finite sets with prescribed cardinalities for pairwise intersections
- Families of finite sets with three intersections
Cited In (38)
- Unavoidable hypergraphs
- Intersecting families with sunflower shadows
- Extremal Problems for Hypergraph Blowups of Trees
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Linear trees in uniform hypergraphs
- Solution of the problem of combinatorial characterization of the dimension of the kernel of a starshaped set
- An \(L\)-system on the small Witt design
- Forbidding complete hypergraphs as traces
- Forbidding just one intersection
- Ryser's conjecture for \(t\)-intersecting hypergraphs
- On generalized Turán number of two disjoint cliques
- Some results on chromaticity of quasilinear hypergraphs
- Maximum size intersecting families of bounded minimum positive co-degree
- Exact solution of some Turán-type problems
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- All rationals occur as exponents
- Hypergraphs without non-trivial intersecting subgraphs
- Improved bounds on the maximum diversity of intersecting families
- Bounds on the Maximum Number of Vectors with given Scalar Products
- On a conjecture of Thomassen concerning subgraphs of large girth
- The dimension of the kernel in an intersection of starshaped sets
- On t-Intersecting Hypergraphs with Minimum Positive Codegrees
- Almost-Fisher families
- Extremal set systems with restricted \(k\)-wise intersections.
- Some structural properties of low-rank matrices related to computational complexity
- Almost-Fisher families
- Dense Induced Subgraphs of Dense Bipartite Graphs
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Hypergraphs with pendant paths are not chromatically unique
- Set systems with three intersections
- Title not available (Why is that?)
- Invitation to intersection problems for finite sets
- Non-trivial \(d\)-wise intersecting families
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
- Hypergraph Turán numbers of linear cycles
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Characterising bimodal collections of sets in finite groups
- A note on a conjecture by Füredi
This page was built for publication: On finite set-systems whose every intersection is a kernel of a star
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787982)
