Results 21 to 30 of about 14,970 (213)
Ramsey numbers of cycles versus general graphs
Forum of Mathematics, Sigma, 2023 The Ramsey number $R(F,H)$ is the minimum number N such that any N-vertex graph either contains a copy of F or its complement contains H. Burr in 1981 proved a pleasingly general result that, for any graph H, provided n is sufficiently large, a ...
John Haslegrave +3 more
doaj +1 more source
Preface: Levon Khachatrian’s legacy in extremal combinatorics
Discrete Applied Mathematics, 2016 Zoltán Füredi, Gyula O. H. Katona
openalex +4 more sources
Chromatic Turán problems and a new upper bound for the Turán density of $\mathcal{K}_4^-$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We consider a new type of extremal hypergraph problem: given an $r$-graph $\mathcal{F}$ and an integer $k≥2$ determine the maximum number of edges in an $\mathcal{F}$-free, $k$-colourable $r$-graph on $n$ vertices.
John Talbot
doaj +1 more source
Substructure Densities in Extremal Combinatorics [PDF]
, 2021 One of the primary goals of combinatorial mathematics is to understand how an object's properties are influenced by the presence or multiplicity of a given substructure. Over time, it has become popular to highlight the asymptotic behaviour of objects by expressing results in terms of the density of substructures.
openaire +2 more sources
On the quaternion projective space
Journal of Taibah University for Science, 2020 Apart from being a vital and exciting field in mathematics with interesting results, projective spaces have various applications in design theory, coding theory, physics, combinatorics, number theory and extremal combinatorial problems. In this paper, we
Y. Omar +4 more
doaj +1 more source
Short proofs of some extremal results [PDF]
, 2013 We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have ...
Beck +11 more
core +5 more sources
, 2014 Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs.
Krivelevich, Michael
core +1 more source
An Extremal Problem for Finite Lattices
Theory and Applications of Graphs, 2016 For a fixed M x N integer lattice L(M,N), we consider the maximum size of a subset A of L(M,N) which contains no squares of prescribed side lengths k(1),...,k(t).
John Goldwasser +2 more
doaj +1 more source
The topological symmetric orbifold
Journal of High Energy Physics, 2020 We analyze topological orbifold conformal field theories on the symmetric product of a complex surface M. By exploiting the mathematics literature we show that a canonical quotient of the operator ring has structure constants given by Hurwitz numbers ...
Songyuan Li, Jan Troost
doaj +1 more source
Excluded subposets in the Boolean lattice [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We are looking for the maximum number of subsets of an n-element set not containing 4 distinct subsets satisfying $A ⊂B, C ⊂B, C ⊂D$. It is proved that this number is at least the number of the $\lfloor \frac{n }{ 2}\rfloor$ -element sets times $1+\frac ...
Gyula O.H. Katona
doaj +1 more source