On generalized graphs
From MaRDI portal
Publication:5512798
DOI10.1007/BF01904851zbMath0138.19404WikidataQ55954285 ScholiaQ55954285MaRDI QIDQ5512798
Publication date: 1965
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
05Cxx: Graph theory
Related Items
Difference graphs, Finding and counting given length cycles, Bounded degrees and prescribed distances in graphs, On cloud-antichains and related configurations, On disjointly representable sets, On Helly families of maximal size, Helly-type hypergraphs and Sperner families, Geometrical solution of an intersection problem for two hypergraphs, Isoperimetric inequalities and fractional set systems, Solution of an extremal problem for sets using resultants of polynomials, Parameterized coloring problems on chordal graphs, Separating systems and oriented graphs of diameter two, On separating systems, First cycles in random directed graph processes, An identity in combinatorial extremal theory, Properties of intersecting families of ordered sets, 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., 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, 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 \cup B \subseteq C \cap D\), Interval Packing and Covering in the Boolean Lattice, Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
Cites Work
