Live briefing
Everything about Common graph
Concept in extremal graph theory
In graph theory, an area of mathematics, common graphs belong to a branch of extremal graph theory concerning inequalities in homomorphism densities. Roughly speaking, is a common graph if it "commonly" appears as a subgraph, in a sense that the total number of copies of in any graph and its complement is a large fraction of all possible copies of on the same vertices. Intuitively, if contains few copies of, then its complement must contain lots of copies of in order to compensate for it. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Common graphA 5-minute orientation
- Skim a recent paper: KNN-GNN: A powerful graph neural network enhanced by aggregating K-nearest neighbors in common subspaceInfluential work since 2022
- Pick up a classic book: Algorithms in C++The most-reprinted book on the subject
- Read the landmark paper: A graph distance metric based on the maximal common subgraphCited 565 times
- Go sideways: GraphonA closely related topic
- Go sideways: Homomorphism densityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A graph distance metric based on the maximal common subgraph
On a relation between graph edit distance and maximum common subgraph
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
A graph distance metric combining maximum common subgraph and minimum common supergraph
C-GRAAL: Common-neighbors-based global GRAph ALignment of biological networks
Deriving common malware behavior through graph clustering
The competition-common enemy graph of a digraph
Graph-Based Surgical Instrument Adaptive Segmentation via Domain-Common Knowledge
🆕 Influential since 2022
KNN-GNN: A powerful graph neural network enhanced by aggregating K-nearest neighbors in common subspace
Topology Derivation Method of Common-Ground Transformerless Single-Phase Inverters Based on Graph Theory
MPCD: A Multitask Graph Transformer for Molecular Property Prediction by Integrating Common and Domain Knowledge
Improving FMEA Comprehensibility via Common-Sense Knowledge Graph Completion Techniques
Wasserstein Hamiltonian Flow with Common Noise on Graph
📚 Books worth reading
Algorithms in C++Robert Sedgewick · 1990
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Graphon In graph theory and statistics, a graphon (also known as a graph limit) is a symmetric measurable function W : [ 0 , 1 ] 2 → [ 0 , 1 ] {\displaystyle W:[0…
- Homomorphism density In the mathematical field of extremal graph theory, homomorphism density with respect to a graph H {\displaystyle H} is a parameter t ( H , − ) {\displaystyle…
- Counting lemma The counting lemmas this article discusses are statements in combinatorics and graph theory. The first one extracts information from ϵ-regular pairs of…
- Sidorenko's conjecture Sidorenko's conjecture is a major conjecture in the field of extremal graph theory, posed by Alexander Sidorenko in 1986. Roughly speaking, the conjecture…
- Oscillator representation In mathematics, the oscillator representation is a projective unitary representation of the symplectic group, first investigated by Irving Segal, David…
- Barnes G-function In mathematics, the Barnes G-function G ( z ) {\displaystyle G(z)} is a function that is an extension of superfactorials to the complex numbers. It is…
- L-semi-inner product In mathematics, there are two different notions of semi-inner-product. The first, and more common, is that of an inner product which is not required to…
- Nevanlinna's criterion In mathematics, Nevanlinna's criterion in complex analysis, proved in 1920 by the Finnish mathematician Rolf Nevanlinna, characterizes holomorphic univalent…