An extremal problem for two families of sets
From MaRDI portal
Publication:1165848
DOI10.1016/S0195-6698(82)80025-5zbMath0488.05004MaRDI QIDQ1165848
Publication date: 1982
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items
\(K_{r,s}\) graph bootstrap percolation ⋮ Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets ⋮ Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Hyperconnectivity of graphs ⋮ The order dimension of two levels of the Boolean lattices ⋮ Extremal binary PFAs in a Černý family ⋮ Circulant almost cross intersecting families ⋮ Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ Deterministic Truncation of Linear Matroids ⋮ Inequalities for two set systems with prescribed intersections ⋮ On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ Synchronizing automata preserving a chain of partial orders ⋮ Strongly connected synchronizing automata and the language of minimal reset words ⋮ The Černý conjecture and 1-contracting automata ⋮ Unnamed Item ⋮ ON A CONJECTURE BY CARPI AND D'ALESSANDRO ⋮ The Synchronization Problem for Locally Strongly Transitive Automata ⋮ Synchronizing Automata on Quasi-Eulerian Digraph ⋮ On two set-systems with restricted cross-intersections ⋮ On the kernel of intersecting families ⋮ Synchronizing times for \(k\)-sets in automata ⋮ Almost intersecting families ⋮ Synchronizing automata with a letter of deficiency 2 ⋮ Set systems related to a house allocation problem ⋮ An asymptotic resolution of a conjecture of Szemerédi and Petruska ⋮ Long running times for hypergraph bootstrap percolation ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Applications of graph containers in the Boolean lattice ⋮ Synchronizing Automata Preserving a Chain of Partial Orders ⋮ On the running time of hypergraph bootstrap percolation ⋮ Weak saturation number of a complete bipartite graph ⋮ Synchronizing words under \textsf{LTL} constraints ⋮ Extremal Binary PFAs with Small Number of States ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Fast synchronization of inhomogenous random automata ⋮ Linear algebra and bootstrap percolation ⋮ Inclusion matrices for rainbow subsets ⋮ Unnamed Item ⋮ Les automates circulaires biaisés vérifient la conjecture de Černý ⋮ The Synchronization Problem for Strongly Transitive Automata ⋮ Lower Bounds for Synchronizing Word Lengths in Partial Automata ⋮ On the Interplay Between Černý and Babai’s Conjectures ⋮ Synchronizing Automata and the Černý Conjecture ⋮ Weak saturation numbers of complete bipartite graphs in the clique ⋮ A note on induced cycles in Kneser graphs ⋮ Saturated \(r\)-uniform hypergraphs ⋮ SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA ⋮ Properties of intersecting families of ordered sets ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ Bounded degrees and prescribed distances in graphs ⋮ WORDS GUARANTEEING MINIMUM IMAGE ⋮ On the maximum running time in graph bootstrap percolation ⋮ Cycle-Saturated Graphs with Minimum Number of Edges ⋮ Finding DFAs with Maximal Shortest Synchronizing Word Length ⋮ Synchronizing generalized monotonic automata ⋮ Intersecting families of discrete structures are typically trivial ⋮ Exact bounds for some hypergraph saturation problems ⋮ Unnamed Item ⋮ Improved upper bounds on synchronizing nondeterministic automata ⋮ The jump number of suborders of the power set order ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ Algebraic synchronization criterion and computing reset words ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time ⋮ On directed local chromatic number, shift graphs, and Borsuk-like graphs ⋮ A generalization of the Bollobás set pairs inequality ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata ⋮ Synchronizing finite automata with short reset words ⋮ Long induced paths and cycles in Kneser graphs ⋮ Modifying the Upper Bound on the Length of Minimal Synchronizing Word ⋮ Matchings and covers in hypergraphs ⋮ A Helly type theorem for hypersurfaces ⋮ Bollobás-type theorems for hemi-bundled two families ⋮ COLLAPSING WORDS: A PROGRESS REPORT ⋮ Intersection patterns of convex sets ⋮ Experiments with Synchronizing Automata ⋮ Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets ⋮ Černý's conjecture and the road colouring problem ⋮ Strongly transitive automata and the Černý conjecture ⋮ Collapsibility of simplicial complexes of hypergraphs ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ Primitive Sets of Nonnegative Matrices and Synchronizing Automata ⋮ On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices ⋮ Geometrical solution of an intersection problem for two hypergraphs ⋮ Hypergraphs without a large star ⋮ Turán numbers and batch codes ⋮ An extremal problem for sets with applications to graph theory ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems ⋮ A simple proof of the upper bound theorem ⋮ Graph bootstrap percolation ⋮ Critical hypergraphs and interesting set-pair systems ⋮ On maximal isolation sets in the uniform intersection matrix ⋮ Density results for uniform families ⋮ REGULARITY OF POWERS OF BIPARTITE GRAPHS
Cites Work
This page was built for publication: An extremal problem for two families of sets
