Results 11 to 20 of about 119,018,322 (196)
Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory [PDF]
, 2015 In this dissertation, we treat several problems in Ramsey theory, probabilistic combinatorics and extremal graph ...
core +3 more sources
Some problems in extremal graph theory and finite geometry
, 2023 Lazebnik, FelixThis thesis is devoted to the study of several problems in extremal graph theory and finite geometry. We study properties such as girth, spectrum, and automorphism group of various families of algebraically defined graphs. We present a new
Taranchuk, Vladislav
core +3 more sources
Two Extremal Problems in Graph Theory
The Electronic Journal of Combinatorics, 1994 We consider the following two problems. (1) Let t and n be positive integers with n t 2. Determine the maximum number of edges of a graph of order n that contains neither K t nor K t;t as a subgraph.
Richard A. Brualdi, Stephen Mellendorf
core +3 more sources
Some Problems in Algebraic and Extremal Graph Theory. [PDF]
, 1995 In this dissertation, we consider a wide range of problems in algebraic and extremal graph theory. In extremal graph theory, we will prove that the Tree Packing Conjecture is true for all sequences of trees that are \u27almost stars\u27; and we prove ...
Dobson, Edward Tauscher +2 more
core +2 more sources
Problems in extremal graph theory and Euclidean Ramsey theory [PDF]
, 2019 This thesis addresses problems of three types. The first type is finding extremal numbers for unions of graphs, each with a colour-critical edge (joint work with V. Nikiforov).
Tsaturian, Sergei
core +3 more sources
An extremal problem in graph theory II [PDF]
Journal of the Australian Mathematical Society, 1980 AbstractWe contine our study of the following combinatorial problem: What is the largest integer N = N (t, m, p) for which there exists a set of N people satisfying the following conditions: (a) each person speaks t languages, (b) among any m people there are two who speak a common language and (c) at most p speak a common language.
Abbott, H. L. +2 more
openaire +2 more sources
An extremal problem in graph theory [PDF]
Journal of the Australian Mathematical Society, 1970 G(n;l) will denote a graph of n vertices and l edges. Let f0(n, k) be the smallest integer such that there is a G (n;f0(n, k)) in which for every set of k vertices there is a vertex joined to each of these. Thus for example fo = 3 since in a triangle each pair of vertices is joined to a third.
Erdős, Pál, Moser, L.
openaire +1 more source
On the conjunctive capacity of graphs [PDF]
, 2013 The investigation of the asymptotic behaviour of various graph parameters in powers of a fixed graph G=(V,E) is motivated by problems in information theory and extremal ...
Chlebikova, Janka +5 more
core +1 more source
Several problems in extremal combinatorics
, 2023 In this thesis, we study several problems from combinatorial probability theory, discrete geometry and extremal graph theory. We establish several extremal results towards our problems.
Zichao Dong (5972447)
core +1 more source
Extremal theory of ordered graphs [PDF]
, 2018 We call simple graphs with a linear order on the vertices ordered graphs. Turán-type extremal graph theory naturally extends to ordered graphs. This is a survey on the ongoing research in the extremal theory of ordered graphs with an emphasis on open ...
Tardos, Gábor
core +2 more sources