scientific article
From MaRDI portal
Publication:3284375
zbMath0101.41001MaRDI QIDQ3284375
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Maximal rank in matrix spaces via graph matchings, Strongly well-covered graphs, Uniquely \(K_r^{(k)}\)-saturated hypergraphs, Turán numbers of sunflowers, Constructive bounds for a Ramsey-type problem, Generating irreducible copositive matrices using the stable set problem, The Szemerédi-Petruska conjecture for a few small values, On the size of 3-uniform linear hypergraphs, Order plus size of τ‐critical graphs, Quasiplanar graphs, string graphs, and the Erdős-Gallai problem, A note on the minimum size of matching-saturated graphs, Ramsey-Turán type results for matchings in edge colored graphs, Unnamed Item, Tolerance in Helly-type theorems, On a generalization of linecritical graphs, Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph, A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem, A dense infinite Sidon sequence, Helly’s theorem: New variations and applications, Generalization of Erdős-Gallai edge bound, On the order of uniquely (k,m)-colourable graphs, Partitions of graphs into small and large sets, Upper bound on the order of tau-critical hypergraphs, Covering Italian domination in graphs, On saturation games, Complexity of stability, Unavoidable hypergraphs, Cross-intersecting pairs of hypergraphs, Complexity of Stability., \(K_4\)-free graphs without large induced triangle-free subgraphs, Über ein Extremalproblem der Graphentheorie, On non-trivial families without a perfect matching, Facets of the linear ordering polytope: a unification for the fence family through weighted graphs, Mixed matchings in graphs, Beyond the Erdős matching conjecture, On the point-core of a graph, Eckhoff's problem on convex sets in the plane, Ramsey-type theorems, Matchings and covers in hypergraphs, Implosive graphs: Square-free monomials on symbolic Rees algebras, Kanten-kritische Graphen mit der Zusammenhangszahl 2, Tibor Gallai, Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs, FPT is characterized by useful obstruction sets, Spectral strengthening of a theorem on transversal critical graphs, Minimum number of elements of representing a set system of given rank, On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition, Fibonacci index and stability number of graphs: a polyhedral study, Personal reminiscences and remarks on the mathematical work of Tibor Gallai, Tibor Gallai - seventy years old, Odd-\(K_{4}\)'s in stability critical graphs, Turán Graphs, Stability Number, and Fibonacci Index, Ear-decompositions of matching-covered graphs, On a weighted generalization of α-critical graphs, Stable sets and polynomials, Local constraints ensuring small representing sets, About an Erdős-Grünbaum conjecture concerning piercing of non-bounded convex sets, Critical hypergraphs and interesting set-pair systems
