Entropy, Search, Complexity [electronic resource]/

Get full text

Impartial Digraphs by Zhao, Yufei, Zhou, Yunkun

“…© 2020, János Bolyai Mathematical Society and Springer-Verlag. We prove a conjecture of Fox, Huang, and Lee that characterizes directed graphs that have constant density in all tournaments: they are disjoint unions of trees that are each constructed in a certain recursive way.…”
Get full text

On the scaling limit of finite vertex transitive graphs with large diameter by Benjamini, Itai, Tessera, Romain, Finucane, Hilary Kiyo

Get full text
Get full text

Coloring intersection graphs of x-monotone curves in the plane by Suk, Andrew

Get full text

On the chromatic number of random geometric graphs by McDiarmid, C, Müller, T

“…Further, we find a "sharp threshold" (except for less interesting choices of the norm when the unit ball tiles d-space): there is a constant t0>0 such that if t≤t0 then, tends to 1 almost surely, but if t>t0 then, tends to a limit >1 almost surely. © 2011 János Bolyai Mathematical Society and Springer Verlag.…”

Few distinct distances implies no heavy lines or circles by Sheffer, Adam, Zahl, Joshua, de Zeeuw, Frank

Get full text
Get full text

Warning’s Second Theorem with restricted variables by Clark, Pete L., Forrow, Aden, Schmitt, John R.

Get full text
Get full text

Independent sets in hypergraphs and Ramsey properties of graphs and the integers by Hancock, R, Staden, K, Treglown, A

“…Math. Stud., János Bolyai Mathematical Society, Budapest, 1993, pp. 317--346; Random Structures Algorithms, 5 (1994), pp. 253--270; J. …”