Skip to search formSkip to main content

Turán's brick factory problem

Known as: Turán's brick factory, Zarankiewicz crossing number conjecture 
In the mathematics of graph drawing, Turán's brick factory problem asks for the minimum number of crossings in a drawing of the complete bipartite… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus… Expand
Is this relevant?
2014
2014
The adsorption studies on the removal of Cr (VI) and Ni (II) ions from aqueous solution using calcined brick powder (CBP) were… Expand
  • figure 2
  • table 1
  • figure 4
  • table 3
  • figure 6
Is this relevant?
2013
2013
Fabrication of LEGO models in large scale requires careful pre-planning to produce constructable and stable models. We propose a… Expand
  • figure 2
  • figure 4
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2011
2011
In this paper,research on the seismic performance of horizontally reinforced gangue porous brick masonry is conducted to provide… Expand
Is this relevant?
2010
2010
The invention provides a baking-free and steaming-free tailing brick and a preparation method thereof. The baking-free steaming… Expand
Is this relevant?
2008
2008
When an emergency occurs within a building, it may be initially safer to send autonomous mobile nodes, instead of human… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2006
2006
Let hλ, eλ, and mλ denote the homogeneous symmetric function, the elementary symmetric function and the monomial symmetric… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Individual variation in behaviour within populations may be explained in part by demographics and long-term, stable individual… Expand
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2002
2002
For a family of r-graphs F, the Turan number ex(n, F) is the maximum number of edges in an n vertex r-graph that does not contain… Expand
Is this relevant?