On generalized graphs - MaRDI portal

Cites work

A Problem in Graph Theory

Cited in

(only showing first 100 items - show all)

Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families
Hypergraphs without a large star
An extremal problem for sets with applications to graph theory
Critical hypergraphs and interesting set-pair systems
Families of finite sets in which no set is covered by the union of \(r\) others
All maximum 2-part Sperner families
Inequalities for two set systems with prescribed intersections
The number of unrelated partitions
Exact solution of some Turán-type problems
On the maximum number of qualitative independent partitions
The size of connected hypergraphs with prescribed covering number
An extremal problem for two families of sets
Upper bound on the order of tau-critical hypergraphs
Saturated r-uniform hypergraphs
A Sperner-type theorem and qualitative independence
Qualitative independence and Sperner problems for directed graphs
Asymptotic growth of sparse saturated structures is locally determined
Helly property in finite set systems
An extremal problem for sets: A new approach via Bezoutians
Mengerian theorems for paths of bounded length
Helly families of maximal size
Long induced paths and cycles in Kneser graphs
A generalization of the AZ identity
Capacities: From information theory to extremal set theory
The order dimension of two levels of the Boolean lattices
A survey of some combinatorial results concerning functional dependencies in database relations.
Extremal problems for finite sets and convex hulls---a survey
Pseudo-LYM inequalities and AZ identities
A Meshalkin theorem for projective geometries
Strong qualitative independence.
On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families
A LYM inequality for induced posets
Edge clique covering sum of graphs
An upper bound on the size of diamond-free families of sets
On the maximum number of points in a maximal intersecting family of finite sets
Hypergraph saturation irregularities
Some new bounds for cover-free families through biclique covers
Saturation numbers for Ramsey-minimal graphs
Matchings and covers in hypergraphs
Graphs with a small number of distinct induced subgraphs
Minimum number of elements of representing a set system of given rank
Sperner systems consisting of pairs of complementary subsets
Solution of a problem of A. Ehrenfeucht and J. Mycielski
A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains
A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
Multicoloured extremal problems
On two set-systems with restricted cross-intersections
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Generalizing Sperner's lemma to a free module over a special principal ideal ring
The feasible region of hypergraphs
Extremal set theory for the binomial norm
Flattening rank and its combinatorial applications
A bound for 1-cross intersecting set pair systems
Old and new applications of Katona's circle
A generalization of the Bollobás set pairs inequality
Covering graphs by monochromatic trees and Helly-type results for hypergraphs
Bollobás-type theorems for hemi-bundled two families
On saturation of Berge hypergraphs
Size and structure of large \((s,t)\)-union intersecting families
A note on k-wise oddtown problems
Set systems related to a house allocation problem
Structural results for conditionally intersecting families and some applications
On almost \(k\)-covers of hypercubes
Weak saturation numbers of complete bipartite graphs in the clique
On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs
Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
Intersecting families of discrete structures are typically trivial
Exact bounds for some hypergraph saturation problems
On clique coverings of complete multipartite graphs
Sprague-Grundy function of matroids and related hypergraphs
On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
Abelian groups yield many large families for the diamond problem
Almost cross-intersecting and almost cross-Sperner pairs of families of sets
On quorum systems for group resources allocation
Treewidth computation and extremal combinatorics
Counting contours on trees
The Boolean rank of the uniform intersection matrix and a family of its submatrices
Structure and supersaturation for intersecting families
Equality of domination and transversal numbers in hypergraphs
AZ-identities and strict 2-part Sperner properties of product posets
An AZ-style identity and Bollobás deficiency
Largest families without an \(r\)-fork
Weighted cross-intersecting families
Kombinatorische Anzahlbestimmungen in Relationen
Largest family without A B C D
Almost intersecting families
Minimum weight flat antichains of subsets
The Szemerédi-Petruska conjecture for a few small values
Intersecting families with sunflower shadows
Saturation problems in convex geometric hypergraphs
Interval packing and covering in the Boolean lattice
Maximum-size antichains in random set-systems
On two-part Sperner systems for regular posets (extended abstract)
Minimum C_k-saturated graphs
Smoothed Analysis on Connected Graphs
Applications of graph containers in the Boolean lattice
On structural decompositions of finite frames
All minimum \(C_{5}\)-saturated graphs
On r-cross intersecting families of sets
Graph bootstrap percolation

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)