A note on extreme sets

DOI10.5614/EJGTA.2017.5.2.9MaRDI QIDQ5006623zbMATH OpenOpenAlexFDO

Authors Radosław Cymer

Publication date 16 August 2021

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2017.5.2.9

zbMATH Keywords

decomposition theorydegree-factorsextreme setsmatching theory

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The extreme set condition of a graph
• scientific article; zbMATH DE number 1916987
• Note on extremal graphs with given matching number
• scientific article; zbMATH DE number 568824
• Maximal tight sets and the Edmonds-Gallai decomposition for matchings

Cites work

• A note on f-factors in directed and undirected multigraphs
• A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
• Gallai-Edmonds decomposition as a pruning technique
• Generalizing \(D\)-graphs
• scientific article; zbMATH DE number 3857160 (Why is no real title available?)
• Matching theory
• On the structure of factorizable graphs
• On the structure of factorizable graphs. II
• The extreme set condition of a graph

Cited in

(2)

• A note on extended stable sets
• A note on a set-valued extension property

This page was built for publication: A note on extreme sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006623)