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

DOI10.1007/S00026-024-00705-2MaRDI QIDQ6644279zbMATH OpenFDO

Authors Maria Axenovich, Ryan R. Martin, Christian Winter

Publication date 27 November 2024

Published in Annals of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00026-024-00705-2

zbMATH Keywords

layered graphsTurán densityTurán-type problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• A class of graphs of zero Turán density in a hypercube
• Generalized Turán densities in the hypercube
• Layered subgraphs of the hypercube
• On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs

Cites work

• B-valuations of graphs
• A class of graphs of zero Turán density in a hypercube
• A hypergraph extension of the bipartite Turán problem
• A note on short cycles in a hypercube
• A note on the edges of the n-cube
• A Ramsey-type result for the hypercube
• A rigorous proof on circular wirelength for hypercubes
• An extremal theorem in the hypercube
• Bounding the size of square-free subgraphs of the hypercube
• Conjectures on wirelength of hypercube into cylinder and torus
• Embedding cycles and meshes onto incomplete hypercubes
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Embedding meshes in hypercubes with edge faults
• Extremal numbers for cycles in a hypercube
• Graph theory
• Hexagon-free subgraphs of hypercubes
• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• scientific article; zbMATH DE number 736295 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• Layered subgraphs of the hypercube
• Maximally Connected Arrays on the n-Cube
• Minimal scrambling sets of simple orders
• New Turán densities for 3-graphs
• On embedding rectangular grids in hypercubes
• On even-cycle-free subgraphs of the hypercube
• On even-cycle-free subgraphs of the hypercube
• On extremal problems of graphs and generalized graphs
• On induced subgraphs of the cube
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Optimal Assignments of Numbers to Vertices
• Predicting \(\{ 0,1\}\)-functions on randomly drawn points
• Some extremal results on complete degenerate hypergraphs
• Some Turán type results on the hypercube
• Subgraphs of a hypercube containing no small even cycles
• Turán’s Theorem in the Hypercube
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

Cited in

(3)

• A class of graphs of zero Turán density in a hypercube
• Layered subgraphs of the hypercube
• \(C_{10}\) has positive Turán density in the hypercube

This page was built for publication: On graphs embeddable in a layer of a hypercube and their extremal numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644279)