On graphs embeddable in a layer of a hypercube and their extremal numbers
From MaRDI portal
Publication:6644279
DOI10.1007/S00026-024-00705-2MaRDI QIDQ6644279
Ryan R. Martin, Maria Axenovich, Christian Winter
Publication date: 27 November 2024
Published in: Annals of Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- 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 induced subgraphs of the cube
- A note on the edges of the n-cube
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Some extremal results on complete degenerate hypergraphs
- A hypergraph extension of the bipartite Turán problem
- Conjectures on wirelength of hypercube into cylinder and torus
- On extremal problems of graphs and generalized graphs
- A note on short cycles in a hypercube
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- A rigorous proof on circular wirelength for hypercubes
- Graph Theory
- Hexagon-free subgraphs of hypercubes
- A Ramsey-type result for the hypercube
- On embedding rectangular grids in hypercubes
- Subgraphs of a hypercube containing no small even cycles
- Embedding meshes in hypercubes with edge faults
- On the maximum number of edges in a c4‐free subgraph of qn
- Embedding cycles and meshes onto incomplete hypercubes
- Turán’s Theorem in the Hypercube
- Maximally Connected Arrays on the n-Cube
- Optimal Assignments of Numbers to Vertices
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- Minimal scrambling sets of simple orders
- $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
- A class of graphs of zero Turán density in a hypercube
- Layered subgraphs of 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)
