Pages that link to "Item:Q396731"
From MaRDI portal
The following pages link to On the size of 3-uniform linear hypergraphs (Q396731):
Displaying 9 items.
- The size of 3-uniform hypergraphs with given matching number and codegree (Q1712519) (← links)
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number (Q2091099) (← links)
- The Turán number for the edge blow-up of trees (Q2231738) (← links)
- On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004) (← links)
- Shadow ratio of hypergraphs with bounded degree (Q2701396) (← links)
- On even-degree subgraphs of linear hypergraphs (Q2883855) (← links)
- (Q3450147) (← links)
- The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm (Q4611853) (← links)
- On 3-uniform hypergraphs without linear cycles (Q5963391) (← links)