Pages that link to "Item:Q1066141"

The following pages link to An extremal problem for sets with applications to graph theory (Q1066141):

Displaying 50 items.

• Linear algebra and bootstrap percolation (Q423652) (← links)
• The solution and applications of a combinatorial problem (Q427911) (← links)
• \(K_{s,t}\)-saturated bipartite graphs (Q482117) (← links)
• On the maximum running time in graph bootstrap percolation (Q528995) (← links)
• Strictly monotonic multidimensional sequences and stable sets in pillage games (Q618306) (← links)
• An extension of a fixed point problem for simple graphs (Q686510) (← links)
• Solution of an extremal problem for sets using resultants of polynomials (Q809102) (← links)
• A simple proof of the upper bound theorem (Q1068364) (← links)
• Hyperconnectivity of graphs (Q1086586) (← links)
• Covering graphs by the minimum number of equivalence relations (Q1103644) (← links)
• On the kernel of intersecting families (Q1106213) (← links)
• A note on induced cycles in Kneser graphs (Q1180426) (← links)
• Asymptotic growth of sparse saturated structures is locally determined (Q1201274) (← links)
• An extremal problem for sets: A new approach via Bezoutians (Q1208052) (← links)
• Matchings and covers in hypergraphs (Q1813100) (← links)
• The extreme set condition of a graph (Q1861250) (← links)
• A sharp threshold for bootstrap percolation in a random hypergraph (Q2042875) (← links)
• Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
• Bollobás-type theorems for hemi-bundled two families (Q2065121) (← links)
• Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
• \(K_{r,s}\) graph bootstrap percolation (Q2121788) (← links)
• Weak saturation numbers of complete bipartite graphs in the clique (Q2221831) (← links)
• Exact bounds for some hypergraph saturation problems (Q2259864) (← links)
• Collapsibility of simplicial complexes of hypergraphs (Q2327224) (← links)
• Counting contours on trees (Q2397386) (← links)
• The partite saturation number of spider (Q2662643) (← links)
• Minimum \(C_k\)-saturated graphs (Q2857396) (← links)
• Graph bootstrap percolation (Q3145835) (← links)
• Extremal sets of subsets satisfying conditions induced by a graph (Q3346368) (← links)
• (Q3972097) (← links)
• (Q4326650) (← links)
• Cycle-Saturated Graphs with Minimum Number of Edges (Q4920660) (← links)
• Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs (Q4992838) (← links)
• Combinatorics in the exterior algebra and the Bollobás Two Families Theorem (Q5034136) (← links)
• Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs (Q5299974) (← links)
• Saturation in the Hypercube and Bootstrap Percolation (Q5366935) (← links)
• Extremal Uniquely Resolvable Multisets (Q5883286) (← links)
• Weakly saturated hypergraphs and a conjecture of Tuza (Q5889737) (← links)
• Extremal bounds for bootstrap percolation in the hypercube (Q5915829) (← links)
• Extremal bounds for bootstrap percolation in the hypercube (Q5970282) (← links)
• Long running times for hypergraph bootstrap percolation (Q6057454) (← links)
• Weak saturation stability (Q6080367) (← links)
• Problems and results on 1-cross-intersecting set pair systems (Q6085875) (← links)
• On the running time of hypergraph bootstrap percolation (Q6106304) (← links)
• Weak saturation number of a complete bipartite graph (Q6107985) (← links)
• Weakly saturated subgraphs of random graphs (Q6112963) (← links)
• Rainbow Saturation for Complete Graphs (Q6130540) (← links)
• Fractional Helly theorem for Cartesian products of convex sets (Q6142359) (← links)
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
• Maximal matroids in weak order posets (Q6187341) (← links)