Extremal edge polytopes
From MaRDI portal
Publication:405274
zbMath1300.05145arXiv1307.6708MaRDI QIDQ405274
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.6708
Turán numbers0/1-polytopesedge polytopes of graphsextremal f-vectorsnumber of facetspseudorandom graphssubpolytopes of a hypersimplex
Extremal problems in graph theory (05C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Related Items
Any finite group is the group of some binary, convex polytope, ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES, The number of $4$-cycles and the cyclomatic number of a finite simple graph, Generalized multiplicities of edge ideals, Laplacian simplices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roots of Ehrhart polynomials arising from graphs
- Ramanujan graphs
- Normal polytopes arising from finite graphs
- On the equations of the edge cone of a graph and some applications
- Polarities and \(2k\)-cycle-free graphs
- The Moore bound for irregular graphs
- Extremal properties of \(0/1\)-polytopes
- The size of bipartite graphs with a given girth
- Separating hyperplanes of edge polytopes
- A note on graphs without short even cycles
- Compressed polytopes, initial ideals and complete multipartite graphs
- On a conjecture of Erdős and Simonovits: even cycles
- Lower bound for the maximal number of facets of a 0/1 polytope
- Über ein Problem von K. Zarankiewicz
- Simple polytopes arising from finite graphs
- Testing subgraphs in large graphs
- Explicit representations of the edge cone of a graph
- Symbolic Rees algebras, vertex covers and irreducible representations of Rees cones
- On the 3‐Local Profiles of Graphs
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- Quasi-random graphs
- Proofs from THE BOOK
- On cliques in graphs
- On 0-1 polytopes with many facets
