An extremal problem for sets with applications to graph theory
From MaRDI portal
Publication:1066141
DOI10.1016/0097-3165(85)90048-2zbMath0578.05002OpenAlexW2063472176WikidataQ100329026 ScholiaQ100329026MaRDI QIDQ1066141
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)90048-2
Extremal problems in graph theory (05C35) Combinatorial aspects of partitions of integers (05A17) Hypergraphs (05C65)
Related Items
\(K_{r,s}\) graph bootstrap percolation, Combinatorics in the exterior algebra and the Bollobás Two Families Theorem, Weakly saturated hypergraphs and a conjecture of Tuza, Hyperconnectivity of graphs, Covering graphs by the minimum number of equivalence relations, On the kernel of intersecting families, Counting contours on trees, The partite saturation number of spider, Strictly monotonic multidimensional sequences and stable sets in pillage games, Long running times for hypergraph bootstrap percolation, Weak saturation stability, Problems and results on 1-cross-intersecting set pair systems, On the running time of hypergraph bootstrap percolation, Weak saturation number of a complete bipartite graph, Weakly saturated subgraphs of random graphs, Rainbow Saturation for Complete Graphs, Fractional Helly theorem for Cartesian products of convex sets, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Linear algebra and bootstrap percolation, Maximal matroids in weak order posets, Saturation in the Hypercube and Bootstrap Percolation, Weak saturation numbers of complete bipartite graphs in the clique, \(K_{s,t}\)-saturated bipartite graphs, A note on induced cycles in Kneser graphs, Asymptotic growth of sparse saturated structures is locally determined, On the maximum running time in graph bootstrap percolation, Cycle-Saturated Graphs with Minimum Number of Edges, An extremal problem for sets: A new approach via Bezoutians, Exact bounds for some hypergraph saturation problems, Unnamed Item, Extremal bounds for bootstrap percolation in the hypercube, A sharp threshold for bootstrap percolation in a random hypergraph, Covering graphs by monochromatic trees and Helly-type results for hypergraphs, Matchings and covers in hypergraphs, Bollobás-type theorems for hemi-bundled two families, Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs, Collapsibility of simplicial complexes of hypergraphs, Extremal bounds for bootstrap percolation in the hypercube, A simple proof of the upper bound theorem, Solution of an extremal problem for sets using resultants of polynomials, Graph bootstrap percolation, Strong edge coloring of Cayley graphs and some product graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intersection patterns of convex sets
- A simple proof of the upper bound theorem
- Hyperconnectivity of graphs
- An extremal problem for two families of sets
- Solution of a problem of A. Ehrenfeucht and J. Mycielski
- A Problem in Graph Theory
- On generalized graphs
- On a Conjecture of Erdos, Hajnal and Moon
