A class of graphs of zero Turán density in a hypercube

DOI10.1017/s0963548324000063MaRDI QIDQ6632811

Maria A. Axenovich

Publication date: 5 November 2024

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

hypercubesubgraphzero densityextremal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• New Turán densities for 3-graphs
• An extremal theorem in the hypercube
• Bounding the size of square-free subgraphs of the hypercube
• Some Turán type results on the hypercube
• On extremal problems of graphs and generalized graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Hexagon-free subgraphs of hypercubes
• Subgraphs of a hypercube containing no small even cycles
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Turán’s Theorem in the Hypercube
• $B$-valuations of graphs
• On even-cycle-free subgraphs of the hypercube
• On even-cycle-free subgraphs of the hypercube
• Extremal numbers for cycles in a hypercube

Related Items (1)

On graphs embeddable in a layer of a hypercube and their extremal numbers

This page was built for publication: A class of graphs of zero Turán density in a hypercube