On generalized graphs
From MaRDI portal
Publication:5512798
DOI10.1007/BF01904851zbMath0138.19404OpenAlexW2068795011WikidataQ55954285 ScholiaQ55954285MaRDI QIDQ5512798
Publication date: 1965
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01904851
Related Items
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem, Nearly-Regular Hypergraphs and Saturation of Berge Stars, Weakly saturated hypergraphs and a conjecture of Tuza, Circulant almost cross intersecting families, Deterministic Truncation of Linear Matroids, TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM, Almost cross-intersecting and almost cross-Sperner pairs of families of sets, Mixing Color Coding-Related Techniques, On quorum systems for group resources allocation, Treewidth computation and extremal combinatorics, Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets, Counting contours on trees, Almost intersecting families, Minimum weight flat antichains of subsets, The Szemerédi-Petruska conjecture for a few small values, Smoothed Analysis on Connected Graphs, An asymptotic resolution of a conjecture of Szemerédi and Petruska, The Boolean rank of the uniform intersection matrix and a family of its submatrices, Counting Homomorphic Cycles in Degenerate Graphs, Long running times for hypergraph bootstrap percolation, Intersecting families with sunflower shadows, Structure and supersaturation for intersecting families, Applications of graph containers in the Boolean lattice, Covering random graphs with monochromatic trees, Polynomial Kernel for Interval Vertex Deletion, Problems and results on 1-cross-intersecting set pair systems, Saturation for the 3-uniform loose 3-cycle, Coloring directed hypergraphs, New ordering methods to construct contagious sets and induced degenerate subgraphs, Generic type of Ahlswede–Zhang style identities, Weak saturation number of a complete bipartite graph, Rainbow Saturation for Complete Graphs, Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method), Formalising the Kruskal-Katona theorem in Lean, The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs, Balanced substructures in bicolored graphs, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Localized versions of extremal problems, Vector sum-intersection theorems, Counting Intersecting and Pairs of Cross-Intersecting Families, Inclusion matrices for rainbow subsets, Saturation numbers for Berge cliques, Sperner's Problem forG-Independent Families, Saturated Graphs of Prescribed Minimum Degree, Saturation problems in convex geometric hypergraphs, Equality of domination and transversal numbers in hypergraphs, Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph, AZ-identities and strict 2-part Sperner properties of product posets, All minimum C5-saturated graphs, An AZ-style identity and Bollobás deficiency, Largest families without an \(r\)-fork, Difference graphs, Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals, Cycle-Saturated Graphs with Minimum Number of Edges, Weighted cross-intersecting families, Intersecting families of discrete structures are typically trivial, Exact bounds for some hypergraph saturation problems, Unnamed Item, Unnamed Item, Interval Packing and Covering in the Boolean Lattice, Partite Saturation of Complete Graphs, Kombinatorische Anzahlbestimmungen in Relationen, Maximum-size antichains in random set-systems, On clique coverings of complete multipartite graphs, On r-Cross Intersecting Families of Sets, On $k$-Neighbor Separated Permutations, On the general position problem on Kneser graphs, A quantitative Lovász criterion for Property B, MinimumK2, 3-Saturated Graphs, Largest family without \(A \cup B \subseteq C \cap D\), 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, Graph bootstrap percolation, On maximal isolation sets in the uniform intersection matrix, Abelian groups yield many large families for the diamond problem, Parameterized coloring problems on chordal graphs, On sizes of 1-cross intersecting set pair systems, On saturation of Berge hypergraphs, A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets, Multicoloured extremal problems, Capacities: From information theory to extremal set theory, The order dimension of two levels of the Boolean lattices, All maximum 2-part Sperner families, On structural decompositions of finite frames, 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, A note on \(k\)-wise oddtown problems, A survey of some combinatorial results concerning functional dependencies in database relations., Extremal problems for finite sets and convex hulls---a survey, On two set-systems with restricted cross-intersections, On degree anti-Ramsey numbers, The number of unrelated partitions, Exact solution of some Turán-type problems, Separating systems and oriented graphs of diameter two, On separating systems, On the maximum number of qualitative independent partitions, Pseudo-LYM inequalities and AZ identities, Sperner type theorems with excluded subposets, Set systems related to a house allocation problem, Structural results for conditionally intersecting families and some applications, Incomparable copies of a poset in the Boolean lattice., Packing posets in the Boolean lattice., A tour of \(M\)-part \(L\)-Sperner families, A Meshalkin theorem for projective geometries, A LYM inequality for induced posets, A modular approach to shared-memory consensus, with applications to the probabilistic-write model, Representative families: a unified tradeoff-based approach, Generalizing Sperner's lemma to a free module over a special principal ideal ring, Edge clique covering sum of graphs, On nested chain decompositions of normalized matching posets of rank 3, 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, First cycles in random directed graph processes, Unavoidable subhypergraphs: \(\mathbf a\)-clusters, The size of connected hypergraphs with prescribed covering number, An identity in combinatorial extremal theory, Strong qualitative independence., An extremal problem for two families of sets, Upper bound on the order of tau-critical hypergraphs, 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, Minimum number of affine simplices of given dimension, Supersaturation and stability for forbidden subposet problems., Saturated \(r\)-uniform hypergraphs, A Sperner-type theorem and qualitative independence, Bounding the number of hyperedges in friendship \(r\)-hypergraphs, Finding and counting given length cycles, Properties of intersecting families of ordered sets, A structural result for 3-graphs, On multiaspect graphs, Bounded degrees and prescribed distances in graphs, Hypergraph saturation irregularities, Qualitative independence and Sperner problems for directed graphs, Asymptotic growth of sparse saturated structures is locally determined, The feasible region of hypergraphs, Some new bounds for cover-free families through biclique covers, Helly property in finite set systems, An extremal problem for sets: A new approach via Bezoutians, Note on set systems without a strong simplex, Extremal set theory for the binomial norm, Extremal \(G\)-free induced subgraphs of Kneser graphs, Flattening rank and its combinatorial applications, A bound for 1-cross intersecting set pair systems, Old and new applications of Katona's circle, Graph-intersecting set systems and LYM inequalities, Mengerian theorems for paths of bounded length, A generalization of the Bollobás set pairs inequality, Saturation numbers for Ramsey-minimal graphs, Covering graphs by monochromatic trees and Helly-type results for hypergraphs, Helly families of maximal size, Long induced paths and cycles in Kneser graphs, Matchings and covers in hypergraphs, On cloud-antichains and related configurations, Bollobás-type theorems for hemi-bundled two families, Graphs with a small number of distinct induced subgraphs, Minimum number of elements of representing a set system of given rank, \(Q _{2}\)-free families in the Boolean lattice, Investigating posets via their maximal chains, Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families, Sperner systems consisting of pairs of complementary subsets, On disjointly representable sets, Solution of a problem of A. Ehrenfeucht and J. Mycielski, On Helly families of maximal size, Helly-type hypergraphs and Sperner families, Geometrical solution of an intersection problem for two hypergraphs, Hypergraphs without a large star, A generalization of the AZ identity, An extremal problem for sets with applications to graph theory, Isoperimetric inequalities and fractional set systems, Solution of an extremal problem for sets using resultants of polynomials, A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains, Critical hypergraphs and interesting set-pair systems, Families of finite sets in which no set is covered by the union of \(r\) others
Cites Work
