Pages that link to "Item:Q3284375"
From MaRDI portal
The following pages link to On the minimal number of vertices representing the edges of a graph (Q3284375):
Displaying 50 items.
- On the size of 3-uniform linear hypergraphs (Q396731) (← links)
- Generalization of Erdős-Gallai edge bound (Q458592) (← links)
- On saturation games (Q499485) (← links)
- Cross-intersecting pairs of hypergraphs (Q507820) (← links)
- Tolerance in Helly-type theorems (Q629843) (← links)
- Ramsey-type theorems (Q751670) (← links)
- Local constraints ensuring small representing sets (Q804606) (← links)
- On the order of uniquely (k,m)-colourable graphs (Q923092) (← links)
- Fibonacci index and stability number of graphs: a polyhedral study (Q1041432) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Odd-\(K_{4}\)'s in stability critical graphs (Q1045088) (← links)
- Ear-decompositions of matching-covered graphs (Q1052341) (← links)
- Critical hypergraphs and interesting set-pair systems (Q1071788) (← links)
- On a generalization of linecritical graphs (Q1149966) (← links)
- A dense infinite Sidon sequence (Q1159234) (← links)
- Upper bound on the order of tau-critical hypergraphs (Q1171073) (← links)
- Stable sets and polynomials (Q1313833) (← links)
- Strongly well-covered graphs (Q1336664) (← links)
- Constructive bounds for a Ramsey-type problem (Q1376057) (← links)
- Uniquely \(K_r^{(k)}\)-saturated hypergraphs (Q1627212) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Minimum number of elements of representing a set system of given rank (Q1823939) (← links)
- Personal reminiscences and remarks on the mathematical work of Tibor Gallai (Q1835908) (← links)
- Tibor Gallai - seventy years old (Q1837176) (← links)
- Tibor Gallai (Q1838469) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- On non-trivial families without a perfect matching (Q2011158) (← links)
- Beyond the Erdős matching conjecture (Q2033940) (← links)
- Eckhoff's problem on convex sets in the plane (Q2049618) (← links)
- Spectral strengthening of a theorem on transversal critical graphs (Q2065896) (← links)
- Covering Italian domination in graphs (Q2231776) (← links)
- Complexity of stability (Q2237893) (← links)
- \(K_4\)-free graphs without large induced triangle-free subgraphs (Q2250854) (← links)
- Mixed matchings in graphs (Q2279983) (← links)
- About an Erdős-Grünbaum conjecture concerning piercing of non-bounded convex sets (Q2351027) (← links)
- Maximal rank in matrix spaces via graph matchings (Q2361549) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
- On the point-core of a graph (Q2523702) (← links)
- Kanten-kritische Graphen mit der Zusammenhangszahl 2 (Q2538487) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- The Szemerédi-Petruska conjecture for a few small values (Q2667158) (← links)
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114) (← links)
- Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- Minimum number of vertices of almost 3-regular graphs with given deficiency (Q2858951) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- On a weighted generalization of α-critical graphs (Q3439372) (← links)
- Über ein Extremalproblem der Graphentheorie (Q3844890) (← links)
- Implosive graphs: Square-free monomials on symbolic Rees algebras (Q4975381) (← links)
