The following pages link to Degrees and matchings (Q1224590):
Displaying 38 items.
- Extremal graph for intersecting odd cycles (Q286112) (← links)
- 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)
- Graphs with restricted valency and matching number (Q1043593) (← links)
- Stirling numbers and records (Q1053046) (← links)
- Extremal graphs for intersecting cliques (Q1417960) (← links)
- The size of 3-uniform hypergraphs with given matching number and codegree (Q1712519) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Graphs whose edge set can be partitioned into maximum matchings (Q1952710) (← links)
- Maximizing the number of cliques in graphs with given matching number (Q2004083) (← links)
- A note on stability for maximal \(F\)-free graphs (Q2053718) (← links)
- Maximum size of a graph with given fractional matching number (Q2088698) (← links)
- Spectral extremal graphs for intersecting cliques (Q2125679) (← links)
- Spectral radius, edge-disjoint cycles and cycles of the same length (Q2138553) (← links)
- The spectral radius of graphs with no intersecting odd cycles (Q2142645) (← links)
- The maximum spectral radius of graphs without friendship subgraphs (Q2209893) (← links)
- The Turán number for the edge blow-up of trees (Q2231738) (← links)
- Turán number and decomposition number of intersecting odd cycles (Q2411603) (← links)
- Extremal graphs for blow-ups of keyrings (Q2657053) (← links)
- Extremal graphs for edge blow-up of graphs (Q2664560) (← links)
- Spectral extremal graphs for disjoint cliques (Q2684892) (← links)
- The Turán number for the edge blow-up of trees: the missing case (Q2699937) (← links)
- Decomposition of Graphs into (k,r)‐Fans and Single Edges (Q4604014) (← links)
- Exact stability for Turán’s Theorem (Q5028504) (← links)
- Decompositions of Graphs into Fans and Single Edges (Q5272925) (← 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)
- Turán number for odd‐ballooning of trees (Q6094026) (← links)
- On Turán problems with bounded matching number (Q6201023) (← links)
- Spectral extremal graphs for edge blow-up of star forests (Q6570057) (← links)
- Generalized Turán results for edge blow-up of star forests (Q6589126) (← links)
- Turán number of the odd-ballooning of complete bipartite graphs (Q6595522) (← links)
- Intersecting families without unique shadow (Q6632795) (← links)
- Spectral extremal problem on \(t\) copies of \(\ell\)-cycles (Q6635172) (← links)
- Extremal graphs for the suspension of edge-critical graphs (Q6671587) (← links)
