An extended lower bound on the number of <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mo stretchy="false">(</mml:mo><mml:mo>⩽</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-edges to generalized configurations of points and the pseudolinear crossing number of <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mi>K</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:math>-Reference-Cited by-同舟云学术

An extended lower bound on the number of (⩽k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn

Published:2008-10 Issue:7 Volume:115 Page:1257-1264
ISSN:0097-3165
Container-title:Journal of Combinatorial Theory, Series A
language:en
Short-container-title:Journal of Combinatorial Theory, Series A

Author:

Ábrego B.M.,Balogh J.,Fernández-Merchant S.,Leaños J.,Salazar G.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference16 articles.

1. A lower bound for the rectilinear crossing number;Ábrego;Graphs Combin.,2005

2. On the crossing number of complete graphs;Aichholzer;Computing,2006

3. New lower bounds for the number of (⩽k)-edges and the rectilinear crossing number of Kn;Aichholzer;Discrete Comput. Geom.,2007

4. O. Aichholzer, D. Orden, P. Ramos, On the structure of sets minimizing the rectilinear crossing number, in: Proc. 22nd European Workshop on Computational Geometry, Delphi, Greece, March 27–29, 2006, pp. 43–47

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The 3-symmetric pseudolinear crossing number of K36;Discrete Mathematics;2024-03

2. New algorithms and bounds for halving pseudolines;Discrete Applied Mathematics;2021-06

3. New Algorithms and Bounds for Halving Pseudolines;Algorithms and Discrete Applied Mathematics;2020

4. Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill;Graph Theory;2016

5. Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n;Discrete & Computational Geometry;2014-11-15