Self-Similarity of Graphs

DOI10.1137/120861436zbMath1272.05087arXiv1201.0924OpenAlexW2592881151MaRDI QIDQ2848546

Choongbum Lee, Po-Shen Loh, Benjamin Sudakov

Publication date: 26 September 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

isomorphic factorizationisomorphic subgraphsdivisible graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (11)

Discrepancy of random graphs and hypergraphs ⋮ On a local similarity of graphs ⋮ Long twins in random words ⋮ Patterns in ordered (random) matchings ⋮ Isomorphisms between random graphs ⋮ Twins in graphs ⋮ Twin subgraphs and core-semiperiphery-periphery structures ⋮ Applications of Markov spectra for the weighted partition network by the substitution rule ⋮ Isomorphic edge disjoint subgraphs of hypergraphs ⋮ Variations on twins in permutations ⋮ Disjoint induced subgraphs of the same order and size

This page was built for publication: Self-Similarity of Graphs