Bounding the number of odd paths in planar graphs via convex optimization

DOI10.1002/JGT.23120MaRDI QIDQ6606323zbMATH OpenFDO

Authors Asaf Cohen Antonir, Asaf Shapira

Publication date 16 September 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

zbMATH Keywords

graph theoryplanar graphsoptimization theory

Mathematics Subject Classification ID

Convex programming (90C25) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• Counting paths, cycles, and blow‐ups in planar graphs
• The maximum number of paths of length four in a planar graph
• The maximum number of copies of an even cycle in a planar graph

Cites work

• scientific article; zbMATH DE number 3902677 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• Connectivity, graph minors, and subgraph multiplicity
• Foundations of Optimization
• Generalized planar Turán numbers
• On the frequency of 3-connected subgraphs of planar graphs
• On the number of cycles of lengthk in a maximal planar graph
• Subgraph densities in a surface
• The maximum number of paths of length four in a planar graph
• The maximum number of paths of length three in a planar graph
• Tree densities in sparse graph classes

Cited in

(1)

• The maximum number of pentagons in a planar graph

This page was built for publication: Bounding the number of odd paths in planar graphs via convex optimization

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