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 13 items.
- Turán numbers of sunflowers (Q5060342) (← links)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) (← links)
- A Rainbow <i>r</i>-Partite Version of the Erdős–Ko–Rado Theorem (Q5366951) (← links)
- Turán Graphs, Stability Number, and Fibonacci Index (Q5505651) (← links)
- The Representation of a Graph by Set Intersections (Q5512009) (← links)
- (Q5567712) (← links)
- (Q5874474) (← links)
- Order plus size of τ‐critical graphs (Q6055381) (← links)
- Complexity of Stability. (Q6065416) (← links)
- A note on the minimum size of matching-saturated graphs (Q6124420) (← links)
- Ramsey-Turán type results for matchings in edge colored graphs (Q6136669) (← links)
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem (Q6563995) (← links)
- Connected Turán number of trees (Q6619396) (← links)