The Cayley isomorphism property for Cayley maps

zbMath1391.05281arXiv1602.02297MaRDI QIDQ1753007

Gábor Somlai, Mikhail E. Muzychuk

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

CI propertyCayley maps

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Planar graphs; geometric and topological aspects of graph theory (05C10) Group actions on combinatorial structures (05E18)

Related Items

Testing isomorphism of circulant objects in polynomial time

Cites Work

• Unnamed Item
• On hypergraph cliques with chromatic number 3
• An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Regular bipartite graphs and intersecting families
• Top-down lower bounds for depth-three circuits
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• Constructions of sparse uniform hypergraphs with high chromatic number
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A note on random greedy coloring of uniform hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On a combinatorial problem. II