Graphs whose the maximum size of an odd subgraph equal to n2

DOI10.1016/J.AMC.2025.129297MaRDI QIDQ6994050zbMATH OpenFDO

Authors Si-Ao Xu, Baoyindureng Wu

Publication date 24 April 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2025.129297

zbMATH Keywords

odd factorsodd subgraphsperfect matchings

Mathematics Subject Classification ID

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

Cites work

• All trees contain a large induced subgraph having all degrees 1 (mod \(k\))
• Every graph contains a linearly sized induced subgraph with all degrees odd
• Every tree contains a large induced subgraph with all degrees odd
• Graph theory
• Graphs where each spanning tree has a perfect matching
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 1051278 (Why is no real title available?)
• Induced subgraphs of a tree with constraint degree
• Large Induced Subgraphs with All Degrees Odd
• Maximum odd induced subgraph of a graph concerning its chromatic number
• Note on Perfect Forests
• Odd induced subgraphs in graphs with treewidth at most two
• Odd induced subgraphs in planar graphs with large girth
• On induced subgraphs of trees, with restricted degrees
• On induced subgraphs with all degree odd
• On induced subgraphs with odd degrees
• On the complexity of finding large odd induced subgraphs and odd colorings

This page was built for publication: Graphs whose the maximum size of an odd subgraph equal to \(\lfloor \frac{n}{2} \rfloor \)

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