On even-cycle-free subgraphs of the doubled Johnson graphs

DOI10.1016/j.amc.2020.125763OpenAlexW3138400264MaRDI QIDQ2242794

Mengyu Cao, Kaishun Wang, Benjian Lv

Publication date: 10 November 2021

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

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

zbMATH Keywords

Turán numberRamsey-type problemdoubled odd graphdoubled Johnson grapheven-cycle-free subgraph

Mathematics Subject Classification ID

Graph theory (05Cxx) Extremal combinatorics (05Dxx)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Terwilliger algebra of the incidence graphs of Johnson geometry
• An extremal theorem in the hypercube
• Bounding the size of square-free subgraphs of the hypercube
• Cycles of even length in graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Hexagon-free subgraphs of hypercubes
• A Ramsey-type result for the hypercube
• Subgraphs of a hypercube containing no small even cycles
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Turán’s Theorem in the Hypercube
• On the structure of linear graphs
• On even-cycle-free subgraphs of the hypercube

This page was built for publication: On even-cycle-free subgraphs of the doubled Johnson graphs