Constructing extremal triangle-free graphs using integer programming

DOI10.1016/J.DISOPT.2023.100802MaRDI QIDQ6957169zbMATH OpenFDO

Authors Ali Erdem Banak, Tınaz Ekim, Z. Caner Taşkın

Publication date 16 July 2025

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISOPT.2023.100802

zbMATH Keywords

extremal graphsfactor-criticalinteger programmingorbital branching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10)

Cites work

• A computational comparison of symmetry handling methods for mixed integer programs
• Degrees and matchings
• Exploiting orbits in symmetric ILP
• Graphs with restricted valency and matching number
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Intersection Theorems for Systems of Sets
• Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
• On the maximum number of edges in chordal graphs of bounded degree and matching number
• Orbital branching
• Practical graph isomorphism. II.
• The NP-completeness column

This page was built for publication: Constructing extremal triangle-free graphs using integer programming

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