Turán, involution and shifting

DOI10.5802/alco.30zbMath1414.05160arXiv1802.03648OpenAlexW2963467624MaRDI QIDQ2421565

Gil Kalai, Eran Nevo

Publication date: 17 June 2019

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.03648

zbMATH Keywords

threshold graphsshifting4)\)-conjectureTurán's \((3

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• Generic initial ideals and exterior algebraic shifting of the join of simplicial complexes
• More constructions for Turan's (3,4)-conjecture
• Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
• A new approach to Turán's conjecture
• An extended Euler-Poincaré theorem
• A class of constructions for Turan's (3,4)-problem
• An upper bound for the Turán number \(t_3(n,4)\)
• Shifting operations and graded Betti numbers
• Algebraic shifting and basic constructions on simplicial complexes
• Reverse lexicographic and lexicographic shifting
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Algebraic shifting and graded Betti numbers
• Maximal number of subsets of a finite set No k of which are pairwise disjoint
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Turán, involution and shifting