https://ogma.newcastle.edu.au/vital/access/ /manager/Index
${session.getAttribute("locale")}5Some new upper bounds of ex(n; {C3,C4})
https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:34671
Wed 04 Sep 2019 09:55:45 AEST]]>Calculating the extremal number ex (v ; {C₃, C₄, ..., Cn})
https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:9241
Sat 24 Mar 2018 11:12:48 AEDT]]>On extremal graphs with bounded girth
https://ogma.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]]>New results on EX graphs
https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11283
t and girth at least g ≥ t + 1. The set of all the graphs of order n, containing no cycles of length ≤ t, and of size ex(n; t), is denoted by EX(n; t) = EX(n; {C₃,C₄, . . . ,Cᵼ }), these graphs are called EX graphs. In 1975, Erdős proposed the problem of determining the extremal numbers ex(n; 4) of a graph of order n 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(29; 6) = 45, also we improve some lower bounds and upper bounds of exᴜ(n; t), for some particular values of n and t.]]>Sat 24 Mar 2018 08:12:43 AEDT]]>Extremal graphs without cycles of length 8 or less
https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:17169
Sat 24 Mar 2018 08:06:31 AEDT]]>Construction of extremal graphs
https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5919
Sat 24 Mar 2018 07:46:46 AEDT]]>