Pages that link to "Item:Q1043593"
From MaRDI portal
The following pages link to Graphs with restricted valency and matching number (Q1043593):
Displaying 12 items.
- On the size of 3-uniform linear hypergraphs (Q396731) (← links)
- Graph classes and Ramsey numbers (Q400493) (← links)
- Generalization of Erdős-Gallai edge bound (Q458592) (← links)
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- The size of 3-uniform hypergraphs with given matching number and codegree (Q1712519) (← links)
- Graphs whose edge set can be partitioned into maximum matchings (Q1952710) (← links)
- Maximum size of a graph with given fractional matching number (Q2088698) (← links)
- The Turán number for the edge blow-up of trees (Q2231738) (← links)
- Extremal graphs for edge blow-up of graphs (Q2664560) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)
- On the maximum number of edges in planar graphs of bounded degree and matching number (Q6041557) (← links)
- Strong chromatic index and Hadwiger number (Q6081549) (← links)
