Results 121 to 130 of about 997,897 (240)

Some Extremal Self-Dual Codes and Unimodular Lattices in Dimension 40 [PDF]

Finite Fields and Their Applications 21 (2013) 67-83, 2011
In this paper, binary extremal singly even self-dual codes of length 40 and extremal odd unimodular lattices in dimension 40 are studied. We give a classification of extremal singly even self-dual codes of length 40. We also give a classification of extremal odd unimodular lattices in dimension 40 with shadows having 80 vectors of norm 2 through their ...
arxiv  

The Turán problem for hypergraphs of fixed size [PDF]

, 2005
We obtain a general bound on the Turán density of a hypergraph in terms of the number of edges that it contains. If F is an r-uniform hypergraph with f edges we show that [pi](F) =3 and f->[infinity]
Keevash, Peter
core  

Extremal graphs for blow-ups of cycles and trees [PDF]

arXiv, 2012
The \emph{blow-up} of a graph $H$ is the graph obtained from replacing each edge in $H$ by a clique of the same size where the new vertices of the cliques are all different. Erd\H{o}s et al. and Chen et al. determined the extremal number of blow-ups of stars. Glebov determined the extremal number and found all extremal graphs for blow-ups of paths.
arxiv  

Extremal graph for intersecting odd cycles [PDF]

arXiv, 2015
An extremal graph for a graph $H$ on $n$ vertices is a graph on $n$ vertices with maximum number of edges that does not contain $H$ as a subgraph. Let $T_{n,r}$ be the Tur\'{a}n graph, which is the complete $r$-partite graph on $n$ vertices with part sizes that differ by at most one.
arxiv  

Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New

, 2021
David Ellis
openalex   +2 more sources

Quasirandom Graphs and the Pantograph Equation. [PDF]

Am Math Mon, 2021
Shapira A, Tyomkyn M.
europepmc   +1 more source

Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]

Order (Dordr), 2023
Couceiro M, Duffus D.
europepmc   +1 more source

Ternary near-extremal self-dual codes of lengths $36$, $48$ and $60$ [PDF]

arXiv
For lengths $36$, $48$ and $60$, we construct new ternary near-extremal self-dual codes with weight enumerators for which no ternary near-extremal self-dual codes were previously known to exist.
arxiv  

A Path Forward: Tropicalization in Extremal Combinatorics

, 2021
Grigoriy Blekherman, Annie Raymond
openalex   +2 more sources

Theory of combinatorial limits and extremal combinatorics [PDF]

In the past years, techniques from different areas of mathematics have been successfully applied in extremal combinatorics problems. Examples include applications of number theory, geometry and group theory in Ramsey theory and analytical methods to ...
Lopes Martins, Taísa
core