418 citations
- University of MiamiUS2 papers
- Academy of Mathematics and Systems ScienceCN1 paper
- California Polytechnic State UniversityUS1 paper
- Central South UniversityCN1 paper
- Chinese Academy of SciencesCN1 paper
- City University of Hong KongHK1 paper
- College of the Holy CrossUS1 paper
- Imperial College LondonGB1 paper
- Indiana UniversityUS1 paper
- Institute for Advanced StudyUS1 paper
- KTH Royal Institute of TechnologySE1 paper
- Michigan State UniversityUS1 paper
4 papers · 1 filter
Complexes of graphs with bounded matching size
Svante Linusson, John Shareshian, Volkmar Welker
For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along w…
Cover pebbling numbers and bounds for certain families of graphs
Nathaniel G. Watson, Carl R. Yerger
Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. The c…
Torsion in the Matching Complex and Chessboard Complex
John Shareshian, Michelle L. Wachs
Topological properties of the matching complex were first studied by Bouc in connection with Quillen complexes, and topological properties of the chessboard complex were first stud…
A sum-product estimate in finite fields, and applications
Jean Bourgain, Nets Katz, Terence Tao
Let be a subset of a finite field for some prime . If for some , then we prove the estimate $|A+A| + |A.A| \geq c(δ) |A|^{1+\eps…