On generalized graphs
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Counting intersecting and pairs of cross-intersecting families
- Nearly-regular hypergraphs and saturation of Berge stars
- Pseudo-LYM inequalities and AZ identities
- On sizes of 1-cross intersecting set pair systems
- Weak rainbow saturation numbers of graphs
- Applications of graph containers in the Boolean lattice
- On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families
- Rainbow Saturation for Complete Graphs
- Saturation for the 3-uniform loose 3-cycle
- \(Q _{2}\)-free families in the Boolean lattice
- Critical hypergraphs and interesting set-pair systems
- Intersecting families with sunflower shadows
- Bounded degrees and prescribed distances in graphs
- The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging
- Abelian groups yield many large families for the diamond problem
- Extremal problems for finite sets and convex hulls---a survey
- Localized versions of extremal problems
- On the maximum number of qualitative independent partitions
- Problems and results on 1-cross-intersecting set pair systems
- Exact bounds for some hypergraph saturation problems
- On almost \(k\)-covers of hypercubes
- Long induced paths and cycles in Kneser graphs
- Graph bootstrap percolation
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Difference graphs
- On the general position problem on Kneser graphs
- Smoothed Analysis on Connected Graphs
- Variations on the Bollobás set-pair theorem
- Saturation problems in convex geometric hypergraphs
- All minimum \(C_{5}\)-saturated graphs
- The feasible region of hypergraphs
- On r-cross intersecting families of sets
- Inequalities for two set systems with prescribed intersections
- Cycle-saturated graphs with minimum number of edges
- Finding and counting given length cycles
- Size and structure of large \((s,t)\)-union intersecting families
- Multicoloured extremal problems
- Minimum number of elements of representing a set system of given rank
- Sperner's problem for \(G\)-independent families
- Mixed orthogonal arrays, \(k\)-dimensional \(M\)-part Sperner multifamilies, and full multitransversals
- Separating systems and oriented graphs of diameter two
- Sprague-Grundy function of matroids and related hypergraphs
- The number of unrelated partitions
- Formalising the Kruskal-Katona theorem in Lean
- Extremal set theory for the binomial norm
- AZ-identities and strict 2-part Sperner properties of product posets
- Treewidth computation and extremal combinatorics
- A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
- On saturation of Berge hypergraphs
- Counting Homomorphic Cycles in Degenerate Graphs
- Saturated r-uniform hypergraphs
- On maximal isolation sets in the uniform intersection matrix
- Weak saturation numbers of complete bipartite graphs in the clique
- Strong qualitative independence.
- A bound for 1-cross intersecting set pair systems
- Helly property in finite set systems
- Structure and supersaturation for intersecting families
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Extremal G-free induced subgraphs of Kneser graphs
- A quantitative Lovász criterion for Property B
- On structural decompositions of finite frames
- The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform -critical hypergraphs
- The order dimension of two levels of the Boolean lattices
- Graph-intersecting set systems and LYM inequalities
- An extremal problem for sets with applications to graph theory
- Kombinatorische Anzahlbestimmungen in Relationen
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- On two set-systems with restricted cross-intersections
- Forgetfulness can make you faster: an O^*(8.097ᵏ)-time algorithm for weighted 3-set k-packing
- Interval packing and covering in the Boolean lattice
- Balanced substructures in bicolored graphs
- A note on k-wise oddtown problems
- Flattening rank and its combinatorial applications
- Hypergraph saturation irregularities
- On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs
- Long running times for hypergraph bootstrap percolation
- Parameterized coloring problems on chordal graphs
- Triangle-free triple systems
- Largest families without an \(r\)-fork
- Exact solution of some Turán-type problems
- Impartial games with decreasing Sprague-Grundy function and their hypergraph compound
- Partite saturation of complete graphs
- On \(k\)-neighbor separated permutations
- An identity in combinatorial extremal theory
- Generic type of Ahlswede-Zhang style identities
- Old and new applications of Katona's circle
- Largest family without A B C D
- An AZ-style identity and Bollobás deficiency
- Some new Bollobás-type inequalities
- Sperner systems consisting of pairs of complementary subsets
- On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
- Inclusion matrices for rainbow subsets
- Incomparable copies of a poset in the Boolean lattice.
- Packing posets in the Boolean lattice.
- Transference for the Erdős-Ko-Rado theorem
- Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families
- A generalization of the AZ identity
- q-analogues of Fisher's inequality and oddtown theorem
- An upper bound on the size of diamond-free families of sets
- Weighted cross-intersecting families
This page was built for publication: On generalized graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5512798)
