crossing number inequality
theorem providing a lower bound to the crossing number; for sufficiently large graphs, the crossing number is not less than a constant times the cube of the number of edges divided by the square of the number of vertices
Pronunciations
British English
/ˈkɹɒsɪŋ ˈnʌmbə ɪniːˈkwɒlɪtɪ/Open converterAmerican English
/ˈkɹɔsɪŋ ˈnʌmbɚ ˌɪnɪˈkwɑləti/Open converter
These IPA transcriptions are generated from the name above. Proper names may have other pronunciations, and current converter results may differ. How transcription works