scientific article; zbMATH DE number 3166040
From MaRDI portal
Publication:3284375
Recommendations
Cited in
(70)- Fibonacci index and stability number of graphs: a polyhedral study
- Vertex- and edge-minimal and locally minimal graphs
- Odd-\(K_{4}\)'s in stability critical graphs
- Ear-decompositions of matching-covered graphs
- Critical hypergraphs and interesting set-pair systems
- On a generalization of linecritical graphs
- A dense infinite Sidon sequence
- Upper bound on the order of tau-critical hypergraphs
- Stable sets and polynomials
- Strongly well-covered graphs
- Constructive bounds for a Ramsey-type problem
- Uniquely \(K_r^{(k)}\)-saturated hypergraphs
- Matchings and covers in hypergraphs
- Minimum number of elements of representing a set system of given rank
- Personal reminiscences and remarks on the mathematical work of Tibor Gallai
- Tibor Gallai - seventy years old
- Tibor Gallai
- Unavoidable hypergraphs
- On non-trivial families without a perfect matching
- Beyond the Erdős matching conjecture
- Eckhoff's problem on convex sets in the plane
- Spectral strengthening of a theorem on transversal critical graphs
- Covering Italian domination in graphs
- Complexity of stability
- \(K_4\)-free graphs without large induced triangle-free subgraphs
- Mixed matchings in graphs
- About an Erdős-Grünbaum conjecture concerning piercing of non-bounded convex sets
- Maximal rank in matrix spaces via graph matchings
- Partitions of graphs into small and large sets
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- On the point-core of a graph
- Kanten-kritische Graphen mit der Zusammenhangszahl 2
- Generating irreducible copositive matrices using the stable set problem
- The Szemerédi-Petruska conjecture for a few small values
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph
- 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: connecting algorithms, kernels, and quasi-orders
- Minimum number of vertices of almost 3-regular graphs with given deficiency
- Helly’s theorem: New variations and applications
- On a weighted generalization of α-critical graphs
- Über ein Extremalproblem der Graphentheorie
- On the size of 3-uniform linear hypergraphs
- Generalization of Erdős-Gallai edge bound
- Implosive graphs: square-free monomials on symbolic Rees algebras
- On saturation games
- Turán numbers of sunflowers
- Cross-intersecting pairs of hypergraphs
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
- A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
- Turán Graphs, Stability Number, and Fibonacci Index
- The Representation of a Graph by Set Intersections
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 7651149 (Why is no real title available?)
- Order plus size of τ‐critical graphs
- Complexity of Stability.
- 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
- Tolerance in Helly-type theorems
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Connected Turán number of trees
- On tight (k,)-stable graphs
- Bounds on isolated scattering number
- Turán number of complete bipartite graphs with bounded matching number
- A proof of the (n, k, t) conjectures
- Maximum spread of graphs with the hereditarily bounded property
- Generalized Turán problems for a matching and long cycles
- Ramsey-type theorems
- Local constraints ensuring small representing sets
- On the order of uniquely (k,m)-colourable graphs
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)
