Degrees and matchings

DOI10.1016/0095-8956(76)90004-6zbMath0324.05119OpenAlexW2143550124MaRDI QIDQ1224590

K. Appert

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90004-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (39)

Spectral extremal graphs for intersecting cliques ⋮ Extremal graph for intersecting odd cycles ⋮ Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Extremal graphs for blow-ups of keyrings ⋮ Extremal graphs for edge blow-up of graphs ⋮ Turán number and decomposition number of intersecting odd cycles ⋮ On the size of 3-uniform linear hypergraphs ⋮ On the maximum number of edges in planar graphs of bounded degree and matching number ⋮ Graph classes and Ramsey numbers ⋮ Strong chromatic index and Hadwiger number ⋮ Turán number for odd‐ballooning of trees ⋮ Spectral extremal graphs for disjoint cliques ⋮ Spectral extremal problem on disjoint color-critical graphs ⋮ On Turán problems with bounded matching number ⋮ Decomposition of Graphs into (k,r)‐Fans and Single Edges ⋮ Graphs whose edge set can be partitioned into maximum matchings ⋮ The Turán number for the edge blow-up of trees: the missing case ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ Extremal graphs for intersecting cliques ⋮ The size of 3-uniform hypergraphs with given matching number and codegree ⋮ Generalization of Erdős-Gallai edge bound ⋮ The Turán number for the edge blow-up of trees ⋮ Spectral extremal graphs for edge blow-up of star forests ⋮ Extremal graphs for the suspension of edge-critical graphs ⋮ Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded ⋮ Maximizing the number of cliques in graphs with given matching number ⋮ Generalized Turán results for edge blow-up of star forests ⋮ Turán number of the odd-ballooning of complete bipartite graphs ⋮ Intersecting families without unique shadow ⋮ Spectral extremal problem on \(t\) copies of \(\ell\)-cycles ⋮ A note on stability for maximal \(F\)-free graphs ⋮ Matchings and covers in hypergraphs ⋮ Graphs with restricted valency and matching number ⋮ Maximum size of a graph with given fractional matching number ⋮ Stirling numbers and records ⋮ On the maximum number of edges in chordal graphs of bounded degree and matching number ⋮ Exact stability for Turán’s Theorem ⋮ Decompositions of Graphs into Fans and Single Edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection theorems for systems of sets
• Intersection Theorems for Systems of Sets
• Some Remarks on a Combinatorial Theorem of Erdös and Rado
• On Independent Complete Subgraphs in a Graph
• On finite δ-systems of Erdős and Rado

This page was built for publication: Degrees and matchings