Add to ORKGWe use the concept of production matrices to show that there exist sets of n points in the plane that admit ¿(41.77n) crossing-free geometric graphs. This improves the previously best known bound of ¿(41.18n) by Aichholzer et al. (2007
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...
AbstractWe improve previous lower bounds on the number of simple polygonizations, and other kinds of...
This paper is a contribution to the problem of counting geometric graphs on point sets. More concret...
We use the concept of production matrices to show that there exist sets of n points in the plane tha...
We use the concept of production matrices to show that there exist sets of n points in the plane tha...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-...
We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-...
AbstractWe improve previous lower bounds on the number of simple polygonizations, and other kinds of...
We use production matrices to count several classes of geometric graphs. We present novel production...
We show that there is a constant α> 0 such that, for any set P of n ≥ 5 points in general positio...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
We present production matrices for non-crossing geometric graphs on point sets in convex position, w...
We present production matrices for non-crossing geometric graphs on point sets in convex position, w...
We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-...
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...
AbstractWe improve previous lower bounds on the number of simple polygonizations, and other kinds of...
This paper is a contribution to the problem of counting geometric graphs on point sets. More concret...
We use the concept of production matrices to show that there exist sets of n points in the plane tha...
We use the concept of production matrices to show that there exist sets of n points in the plane tha...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-...
We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-...
AbstractWe improve previous lower bounds on the number of simple polygonizations, and other kinds of...
We use production matrices to count several classes of geometric graphs. We present novel production...
We show that there is a constant α> 0 such that, for any set P of n ≥ 5 points in general positio...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
We present production matrices for non-crossing geometric graphs on point sets in convex position, w...
We present production matrices for non-crossing geometric graphs on point sets in convex position, w...
We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-...
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...
AbstractWe improve previous lower bounds on the number of simple polygonizations, and other kinds of...
This paper is a contribution to the problem of counting geometric graphs on point sets. More concret...