# Eran Nevo

According to our database1, Eran Nevo authored at least 20 papers between 2002 and 2020.

Collaborative distances:
• Dijkstra number2 of four.
• Erdős number3 of two.

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2020
Induced equators in flag spheres.
J. Comb. Theory, Ser. A, 2020

Complexity Yardsticks for f-Vectors of Polytopes and Spheres.
Discret. Comput. Geom., 2020

2019
A Lower Bound Theorem for Centrally Symmetric Simplicial Polytopes.
Discret. Comput. Geom., 2019

On the Reconstruction of Polytopes.
Discret. Comput. Geom., 2019

2018
Pach's Selection Theorem Does Not Admit a Topological Extension.
Discret. Comput. Geom., 2018

2017
Bounds for Entries of γ-Vectors of Flag Homology Spheres.
SIAM J. Discret. Math., 2017

2016
On the maximum order of graphs embedded in surfaces.
J. Comb. Theory, Ser. B, 2016

Generalized Tchebyshev triangulations.
J. Comb. Theory, Ser. A, 2016

Bipartite minors.
J. Comb. Theory, Ser. B, 2016

2012
Nonpolytopal Nonsimplicial Lattice Spheres with Nonnegative Toric g-Vector.
Discret. Comput. Geom., 2012

2011
The gamma-vector of a barycentric subdivision.
J. Comb. Theory, Ser. A, 2011

A characterization of simplicial polytopes with g<sub>2</sub>=1.
J. Comb. Theory, Ser. A, 2011

Regularity of edge ideals of C<sub>4</sub>-free graphs via the topology of the lcm-lattice.
J. Comb. Theory, Ser. A, 2011

On <i>γ</i>-Vectors Satisfying the Kruskal-Katona Inequalities.
Discret. Comput. Geom., 2011

2009
Remarks on Missing Faces and Generalized Lower Bounds on Face Numbers.
Electron. J. Comb., 2009

2008
Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes.
Discret. Comput. Geom., 2008

2007
On embeddability and stresses of graphs.
Comb., 2007

2006
A generalized Macaulay theorem and generalized face rings.
J. Comb. Theory, Ser. A, 2006

2004
Lenses in arrangements of pseudo-circles and their applications.
J. ACM, 2004

2002
Lenses in arrangements of pseudo-circles and their applications.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8698377013206482, "perplexity": 16175.064779354629}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618039490226.78/warc/CC-MAIN-20210420183658-20210420213658-00475.warc.gz"}