https://nova.newcastle.edu.au/vital/access/manager/Index en-au 5 https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:9351 Sat 24 Mar 2018 08:36:27 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:7645 t, and girth (length of shortest cycle) at least g ≥ t + 1. In 1975, Erdős proposed the problem of determining the extremal numbers ex(n;4) of a graph of n vertices and girth at least 5. In this paper, we consider a generalized version of this problem, for t ≥ 5. In particular, we prove that ex(n;6) for n = 29, 30 and 31 is equal to 45, 47 and 49, respectively.]]> Sat 24 Mar 2018 08:35:58 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:8038 Sat 24 Mar 2018 08:35:04 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:12471 Sat 24 Mar 2018 08:16:30 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:11492 Sat 24 Mar 2018 08:10:25 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:10371 Sat 24 Mar 2018 08:08:50 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:17169 Sat 24 Mar 2018 08:06:31 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:17514 Sat 24 Mar 2018 08:03:50 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:16258 Sat 24 Mar 2018 07:54:17 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:30205 Sat 24 Mar 2018 07:31:04 AEDT ]]> https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:4799 Sat 24 Mar 2018 07:20:40 AEDT ]]>