On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(200002)33:2<66::AID-JGT2>3.0.CO;2-L" /><66::AID-JGT2>3.0.CO;2-L 10.1002/(SICI)1097-0118(200002)33:2<66::AID-JGT2>3.0.CO;2-LzbMath0944.05059OpenAlexW4230005395MaRDI QIDQ4946543

Richard H. Schelp, Andrew G. Thomason

Publication date: 15 September 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200002)33:2<66::aid-jgt2>3.0.co;2-l

zbMATH Keywords

directed graph4-cycle\(n\)-cube

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Bounding the size of square-free subgraphs of the hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• Highly symmetric subgraphs of hypercubes
• Hexagon-free subgraphs of hypercubes
• Lower bounds on the number of triangles in a graph
• Blue-Empty Chromatic Graphs
• Subgraphs of a hypercube containing no small even cycles
• A Remark on the Number of Complete and Empty Subgraphs
• On the maximum number of edges in a c₄‐free subgraph of q_n

This page was built for publication: On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs