@article{10335,
  abstract     = {Van der Holst and Pendavingh introduced a graph parameter σ, which coincides with the more famous Colin de Verdière graph parameter μ for small values. However, the definition of a is much more geometric/topological directly reflecting embeddability properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G) for any graph G. We confirm this conjecture. As far as we know, this is the first topological upper bound on σ(G) which is, in general, tight.
Equality between μ and σ does not hold in general as van der Holst and Pendavingh showed that there is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8. We also prove that, in general, the gap can be large: The incidence graphs Hq of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2.},
  author       = {Kaluza, Vojtech and Tancer, Martin},
  issn         = {0209-9683},
  journal      = {Combinatorica},
  pages        = {1317--1345},
  publisher    = {Springer Nature},
  title        = {{Even maps, the Colin de Verdière number and representations of graphs}},
  doi          = {10.1007/s00493-021-4443-7},
  volume       = {42},
  year         = {2022},
}

@article{9582,
  abstract     = {The problem of finding dense induced bipartite subgraphs in H-free graphs has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer. In this paper, we obtain several results in this direction. First we prove that any H-free graph with minimum degree at least d contains an induced bipartite subgraph of minimum degree at least cH log d/log log d, thus nearly confirming one and proving another conjecture of Esperet, Kang and Thomassé. Complementing this result, we further obtain optimal bounds for this problem in the case of dense triangle-free graphs, and we also answer a question of Erdœs, Janson, Łuczak and Spencer.},
  author       = {Kwan, Matthew Alan and Letzter, Shoham and Sudakov, Benny and Tran, Tuan},
  issn         = {1439-6912},
  journal      = {Combinatorica},
  number       = {2},
  pages        = {283--305},
  publisher    = {Springer},
  title        = {{Dense induced bipartite subgraphs in triangle-free graphs}},
  doi          = {10.1007/s00493-019-4086-0},
  volume       = {40},
  year         = {2020},
}

@article{7034,
  abstract     = {We find a graph of genus 5 and its drawing on the orientable surface of genus 4 with every pair of independent edges crossing an even number of times. This shows that the strong Hanani–Tutte theorem cannot be extended to the orientable surface of genus 4. As a base step in the construction we use a counterexample to an extension of the unified Hanani–Tutte theorem on the torus.},
  author       = {Fulek, Radoslav and Kynčl, Jan},
  issn         = {1439-6912},
  journal      = {Combinatorica},
  number       = {6},
  pages        = {1267--1279},
  publisher    = {Springer Nature},
  title        = {{Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4}},
  doi          = {10.1007/s00493-019-3905-7},
  volume       = {39},
  year         = {2019},
}

@article{4053,
  abstract     = {We show that the maximum number of edges bounding m faces in an arrangement of n line segments in the plane is O(m2/3n2/3+nα(n)+nlog m). This improves a previous upper bound of Edelsbrunner et al. [5] and almost matches the best known lower bound which is Ω(m2/3n2/3+nα(n)). In addition, we show that the number of edges bounding any m faces in an arrangement of n line segments with a total of t intersecting pairs is O(m2/3t1/3+nα(t/n)+nmin{log m,log t/n}), almost matching the lower bound of Ω(m2/3t1/3+nα(t/n)) demonstrated in this paper.},
  author       = {Aronov, Boris and Edelsbrunner, Herbert and Guibas, Leonidas and Sharir, Micha},
  issn         = {0209-9683},
  journal      = {Combinatorica},
  number       = {3},
  pages        = {261 -- 274},
  publisher    = {Springer},
  title        = {{The number of edges of many faces in a line segment arrangement}},
  doi          = {10.1007/BF01285815},
  volume       = {12},
  year         = {1992},
}

@article{4069,
  abstract     = {Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.},
  author       = {Edelsbrunner, Herbert},
  issn         = {1439-6912},
  journal      = {Combinatorica},
  number       = {3},
  pages        = {251 -- 260},
  publisher    = {Springer},
  title        = {{An acyclicity theorem for cell complexes in d dimension}},
  doi          = {10.1007/BF02122779},
  volume       = {10},
  year         = {1990},
}