Extremal threshold graphs for matchings and independent sets

DOI10.1007/s00373-018-1941-5zbMath1402.05114arXiv1710.00083OpenAlexW2963711107WikidataQ129289047 ScholiaQ129289047MaRDI QIDQ1756116

Andrew John Radcliffe, Lauren Keough

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.00083

zbMATH Keywords

matchingsindependent setsextremal graph theorythreshold graphsalmost alternating graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On the activities and partitions of the vertex subsets of graphs

Cites Work

• Graphs with the fewest matchings
• Extremal problems for independent set enumeration
• Threshold graphs and related topics
• Graphs with maximal number of adjacent pairs of edges
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal threshold graphs for matchings and independent sets