Erdős Graphs Resolve Fine's Canonicity Problem

E-ISSN： 1943-5894|10|2|186-208

ISSN： 1079-8986

Source： Bulletin of Symbolic Logic, Vol.10, Iss.2, 2004-06, pp. : 186-208

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

More on an Erdős–Szekeres-Type Problem for Interior Points

By Wei Xianglin Ding Ren

Discrete & Computational Geometry, Vol. 42, Iss. 4, 2009-12 ,pp. : 640-653

Springer Publishing Company

Access to resources Recommend Favorite

Computer solution to the 17-point Erdős-Szekeres problem

ANZIAM Journal, Vol. 48, Iss. 2, 2006-10 ,pp. : 151-164

Cambridge University Press

Access to resources Recommend Favorite

On some generalisations of the Erdős distance problem over finite fields

Bulletin of the Australian Mathematical Society, Vol. 73, Iss. 2, 2006-04 ,pp. : 285-292

Cambridge University Press

Access to resources Recommend Favorite

ON SUM OF PRODUCTS AND THE ERDŐS DISTANCE PROBLEM OVER FINITE FIELDS

Bulletin of the Australian Mathematical Society, Vol. 84, Iss. 1, 2011-06 ,pp. : 1-9

Cambridge University Press

Access to resources Recommend Favorite

On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency

By Li C.H. Praeger C.E.

European Journal of Combinatorics, Vol. 20, Iss. 4, 1999-05 ,pp. : 279-292

Elsevier

Access to resources Recommend Favorite