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