Pages that link to "Item:Q2674562"
From MaRDI portal
The following pages link to On the maximum number of edges in hypergraphs with fixed matching and clique number (Q2674562):
Displaying 8 items.
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
- A new generalization of Mantel's theorem to \(k\)-graphs (Q885302) (← links)
- Resilient hypergraphs with fixed matching number (Q1715070) (← links)
- Maximizing the number of cliques in graphs with given matching number (Q2004083) (← links)
- The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)
- Many Cliques in Bounded-Degree Hypergraphs (Q6170441) (← links)