The maximum number of 3- and 4-cliques within a planar maximally filtered graph

DOI10.1016/j.physa.2014.09.011zbMath1395.05123arXiv1507.02929OpenAlexW2032318061MaRDI QIDQ1783249

Athanasios A. Pantelous, Jenna Birch, Konstantin M. Zuev

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.02929

zbMATH Keywords

3- and 4-cliquescorrelation based networksEberhard's operationplanar maximally filtered graphsstandard spherical triangulation

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Correlation based networks of equity returns sampled at different time horizons
• Diagonal flips in triangulations of surfaces
• The Structure and Function of Complex Networks
• High-frequency cross-correlation in a set of stocks
• Asset Trees and Asset Graphs in Financial Markets
• Introduction to Econophysics

This page was built for publication: The maximum number of 3- and 4-cliques within a planar maximally filtered graph