Twins in graphs

DOI10.1016/j.ejc.2014.01.007zbMath1284.05170arXiv1303.5626OpenAlexW2038298729MaRDI QIDQ2441959

Torsten Ueckerdt, Ryan R. Martin, Maria A. Axenovich

Publication date: 31 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

pigeonhole principle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Disjoint induced subgraphs of the same order and size

Cites Work

• Unnamed Item
• On isomorphic subgraphs
• Kneser's conjecture, chromatic number, and homotopy
• Large induced subgraphs with equated maximum degree
• Large disjoint subgraphs with the same order and size
• Perfectly balanced partitions of smoothed graphs
• Equitable coloring of trees
• A regularity lemma and twins in words
• Homometric sets in trees
• Self-Similarity of Graphs
• Disjoint homometric sets in graphs
• Balanced Subset Sums in Dense Sets of Integers
• Decycling graphs
• Induced subgraphs of prescribed size

This page was built for publication: Twins in graphs