The maximum of the maximum rectilinear crossing numbers of -regular graphs of order .
Alpert, Matthew, Feder, Elie, Harborth, Heiko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Alpert, Matthew, Feder, Elie, Harborth, Heiko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cattaneo, Alberto S., Cotta-Ramusino, Paolo, Longoni, Riccardo (2002)
Algebraic & Geometric Topology
Similarity:
Hamburger, Peter, Haxell, Penny, Kostochka, Alexandr (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Huang, Po-Yi, Ma, Jun, Yeh, Yeong-Nan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alon, Noga, Ruszinkó, Miklós (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Caro, Yair (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Jaehoon Kim, Alexandr V. Kostochka (2014)
Discussiones Mathematicae Graph Theory
Similarity:
We show that an n-vertex hypergraph with no r-regular subgraphs has at most 2n−1+r−2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraphs having the maximum number of edges contains a full star, that is, 2n−1 distinct edges containing a given vertex. We prove this conjecture for n ≥ 425. The condition that n > r cannot be weakened.
Jan Mařík (1994)
Mathematica Bohemica
Similarity:
A compact set is constructed such that each horizontal or vertical line intersects in at most one point while the -dimensional measure of is infinite for every .
Philippe Gravejat (2004)
Annales de l'I.H.P. Analyse non linéaire
Similarity: