Pages that link to "Item:Q1165848"
From MaRDI portal
The following pages link to An extremal problem for two families of sets (Q1165848):
Displaying 50 items.
- The Černý conjecture and 1-contracting automata (Q311503) (← links)
- Linear algebra and bootstrap percolation (Q423652) (← links)
- On the maximum running time in graph bootstrap percolation (Q528995) (← links)
- The jump number of suborders of the power set order (Q583248) (← links)
- Bounded degrees and prescribed distances in graphs (Q686447) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- Intersection patterns of convex sets (Q762464) (← links)
- Geometrical solution of an intersection problem for two hypergraphs (Q798334) (← links)
- Extremal binary PFAs in a Černý family (Q832924) (← links)
- Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
- Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
- Properties of intersecting families of ordered sets (Q949778) (← links)
- Improved upper bounds on synchronizing nondeterministic automata (Q989550) (← links)
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
- Hypergraphs without a large star (Q1061141) (← links)
- An extremal problem for sets with applications to graph theory (Q1066141) (← links)
- A simple proof of the upper bound theorem (Q1068364) (← links)
- Critical hypergraphs and interesting set-pair systems (Q1071788) (← links)
- Hyperconnectivity of graphs (Q1086586) (← links)
- Inequalities for two set systems with prescribed intersections (Q1090680) (← links)
- On the kernel of intersecting families (Q1106213) (← links)
- A note on induced cycles in Kneser graphs (Q1180426) (← links)
- Saturated \(r\)-uniform hypergraphs (Q1184855) (← links)
- Long induced paths and cycles in Kneser graphs (Q1263600) (← links)
- Density results for uniform families (Q1323482) (← links)
- The order dimension of two levels of the Boolean lattices (Q1337568) (← links)
- On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families (Q1631618) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- Synchronizing generalized monotonic automata (Q1763695) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- A Helly type theorem for hypersurfaces (Q1819733) (← links)
- Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets (Q1827343) (← links)
- A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets (Q1877683) (← links)
- On two set-systems with restricted cross-intersections (Q1902973) (← links)
- A generalization of the Bollobás set pairs inequality (Q2040005) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Bollobás-type theorems for hemi-bundled two families (Q2065121) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- \(K_{r,s}\) graph bootstrap percolation (Q2121788) (← links)
- Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
- Synchronizing times for \(k\)-sets in automata (Q2170794) (← links)
- Set systems related to a house allocation problem (Q2182206) (← links)
- Weak saturation numbers of complete bipartite graphs in the clique (Q2221831) (← links)
- Intersecting families of discrete structures are typically trivial (Q2258906) (← links)
- Exact bounds for some hypergraph saturation problems (Q2259864) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- Collapsibility of simplicial complexes of hypergraphs (Q2327224) (← links)
- On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method (Q2341076) (← links)
