Cargando…
A Sharp Threshold Phenomenon in String Graphs
A string graph is the intersection graph of curves in the plane. We prove that for every [Formula: see text] , if G is a string graph with n vertices such that the edge density of G is below [Formula: see text] , then V(G) contains two linear sized subsets A and B with no edges between them. The con...
Autor principal: | Tomon, István |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8709829/ https://www.ncbi.nlm.nih.gov/pubmed/35023884 http://dx.doi.org/10.1007/s00454-021-00279-3 |
Ejemplares similares
-
Sharp threshold for random graphs with a monochromatic triangle in every edge coloring
por: Friedgut, Ehud, et al.
Publicado: (2005) -
Higgs phenomenon in string theories
por: Antoniadis, Ignatios, et al.
Publicado: (1987) -
Isoscattering strings of concatenating graphs and networks
por: Ławniczak, Michał, et al.
Publicado: (2021) -
Sharp thresholds limit the benefit of defector avoidance in cooperation on networks
por: Fahimipour, Ashkaan K., et al.
Publicado: (2022) -
Complexity Issues of String to Graph Approximate Matching
por: Dondi, Riccardo, et al.
Publicado: (2020)