Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)

DOI10.1016/j.akcej.2017.03.006zbMath1375.05145OpenAlexW2610737932MaRDI QIDQ1680880

Novi H. Bong

Publication date: 17 November 2017

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.03.006

zbMATH Keywords

extremal graphforbidden subgraphextremal number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Constraints for symmetry breaking in graph representation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A smallest graph of girth 5 and valency 6
• On Moore Graphs with Diameters 2 and 3
• On the uniqueness of the smallest graph of girth 5 and valency 6
• Extremal graphs without three‐cycles or four‐cycles
• On the structure of extremal graphs of high girth
• Isomorph-Free Exhaustive Generation
• There is No Irregular Moore Graph

This page was built for publication: Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)