Extremal even-cycle-free subgraphs of the complete transposition graphs

DOI10.1016/j.amc.2021.126223OpenAlexW3154960276MaRDI QIDQ2243230

Kaishun Wang, Benjian Lv, Mengyu Cao, Sanming Zhou

Publication date: 11 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

Turán numberRamsey-type problemcomplete transposition grapheven-cycle-free subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items

Subgroup regular sets in Cayley graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some conditional vertex connectivities of complete-transposition graphs
• Automorphism group of the complete transposition graph
• Separator theorems and Turán-type results for planar intersection graphs
• An extremal theorem in the hypercube
• Bounding the size of square-free subgraphs of the hypercube
• Bisection width of transposition graphs
• Cycles of even length in graphs
• On even-cycle-free subgraphs of the doubled Johnson graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• A semi-algebraic version of Zarankiewicz's problem
• Hexagon-free subgraphs of hypercubes
• A Ramsey-type result for the hypercube
• Subgraphs of a hypercube containing no small even cycles
• On the bisection width of the transposition network
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Turán’s Theorem in the Hypercube
• On even-cycle-free subgraphs of the hypercube