@article{12680,
  abstract     = {The celebrated Erdős–Ko–Rado theorem about the maximal size of an intersecting family of r-element subsets of  was extended to the setting of exterior algebra in [5, Theorem 2.3] and in [6, Theorem 1.4]. However, the equality case has not been settled yet. In this short note, we show that the extension of the Erdős–Ko–Rado theorem and the characterization of the equality case therein, as well as those of the Hilton–Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms follow from a folklore puzzle about possible arrangements of an intersecting family of lines.},
  author       = {Ivanov, Grigory and Köse, Seyda},
  issn         = {0012-365X},
  journal      = {Discrete Mathematics},
  number       = {6},
  publisher    = {Elsevier},
  title        = {{Erdős-Ko-Rado and Hilton-Milner theorems for two-forms}},
  doi          = {10.1016/j.disc.2023.113363},
  volume       = {346},
  year         = {2023},
}

@article{6638,
  abstract     = {The crossing number of a graph G is the least number of crossings over all possible drawings of G. We present a structural characterization of graphs with crossing number one.},
  author       = {Silva, André  and Arroyo Guevara, Alan M and Richter, Bruce and Lee, Orlando},
  issn         = {0012-365X},
  journal      = {Discrete Mathematics},
  number       = {11},
  pages        = {3201--3207},
  publisher    = {Elsevier},
  title        = {{Graphs with at most one crossing}},
  doi          = {10.1016/j.disc.2019.06.031},
  volume       = {342},
  year         = {2019},
}

@article{4065,
  abstract     = {We prove that given n⩾3 convex, compact, and pairwise disjoint sets in the plane, they may be covered with n non-overlapping convex polygons with a total of not more than 6n−9 sides, and with not more than 3n−6 distinct slopes. Furthermore, we construct sets that require 6n−9 sides and 3n−6 slopes for n⩾3. The upper bound on the number of slopes implies a new bound on a recently studied transversal problem.},
  author       = {Edelsbrunner, Herbert and Robison, Arch and Shen, Xiao},
  issn         = {1872-681X},
  journal      = {Discrete Mathematics},
  number       = {2},
  pages        = {153 -- 164},
  publisher    = {Elsevier},
  title        = {{Covering convex sets with non-overlapping polygons}},
  doi          = {10.1016/0012-365X(90)90147-A},
  volume       = {81},
  year         = {1990},
}

@article{4107,
  abstract     = {A set of m planes dissects E3 into cells, facets, edges and vertices. Letting deg(c) be the number of facets that bound a cellc, we give exact and asymptotic bounds on the maximum of ∈cinCdeg(c), if C is a family of cells of the arrangement with fixed cardinality.},
  author       = {Edelsbrunner, Herbert and Haussler, David},
  issn         = {1872-681X},
  journal      = {Discrete Mathematics},
  number       = {C},
  pages        = {139 -- 146},
  publisher    = {Elsevier},
  title        = {{The complexity of cells in 3-dimensional arrangements}},
  doi          = {10.1016/0012-365X(86)90008-7},
  volume       = {60},
  year         = {1986},
}