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

DOI10.1002/JGT.23120zbMATH Open1547.0506MaRDI QIDQ6606323

Asaf Cohen Antonir, Asaf Shapira

Publication date: 16 September 2024

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

zbMATH Keywords

graph theoryplanar graphsoptimization theory

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The maximum number of paths of length four in a planar graph
• 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
• Connectivity, graph minors, and subgraph multiplicity
• Tree densities in sparse graph classes
• Foundations of Optimization
• Subgraph densities in a surface
• The maximum number of paths of length three in a planar graph

Related Items (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)