Results 41 to 50 of about 934 (196)
Generalized Ramsey–Turán density for cliques
Forum of Mathematics, SigmaWe study the generalized Ramsey–Turán function $\mathrm {RT}(n,K_s,K_t,o(n))$ , which is the maximum possible number of copies of $K_s$ in an n-vertex $K_t$ -free graph with independence number $o(n)$ . The case when $s=2$
Jun Gao +3 more
doaj +1 more source
Pairwise Intersections and Forbidden Configurations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let $f_m(a,b,c,d)$ denote the maximum size of a family $\mathcal{F}$ of subsets of an $m$-element set for which there is no pair of subsets $A,B \in \mathcal{F}$ with $|A \cap B| \geq a$, $|\bar{A} \cap B| \geq b$, $|A \cap \bar{B}| \geq c$, and $|\bar{A}
Richard P. Anstee, Peter Keevash
doaj +1 more source
International Journal of Mathematical Combinatorics, Vol.5 [PDF]
, 2011 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Extremal Permanents of Laplacian Matrices of Unicyclic Graphs
AxiomsThe extremal problem of Laplacian permanents of graphs is a classical and challenging topic in algebraic combinatorics, where the inherent #P-complete complexity of permanent computation renders this pursuit particularly intractable.
Tingzeng Wu +2 more
doaj +1 more source
On extremal sets without coprimes
, 1994 Ahlswede R, Khachatrian LH. On extremal sets without coprimes. Acta Arithmetica.
Levon Khachatrian +4 more
core +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 ...
Sudakov, Benny +5 more
core +1 more source
A proof of the Elliott–Rödl conjecture on hypertrees in Steiner triple systems
Forum of Mathematics, SigmaHypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given $\mu>0$ , there exists $n_0$ such that the following holds.
Seonghyuk Im +3 more
doaj +1 more source
Additive energies on discrete cubes
Discrete Analysis, 2023 One definition of additive combinatorics is that it is the study of subsets of (usually Abelian) groups. Two much studied parameters associated with a subset $A$ are the size of its sumset $A+A=\{a+b:a,b\in A\}$ (or the product set $A.A=\{a.b:a,b\in A\}$
Jaume de Dios Pont +3 more
doaj +1 more source
Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP
CoRR, 2022 We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This results in the definition of a new complexity class within TFNP, which we call PLC (for "polynomial long choice ...
Pasarkar, Amol +2 more
openaire +4 more sources
Angewandte Chemie International Edition, EarlyView.Pareto optimal compositions of alloy catalyst for oxygen reduction reaction are uncovered through multi‐objective Bayesian optimization of activity, stability, and material cost in an eight‐element high‐entropy alloy composition space. The substantial Pareto front obtained is compared to experimental literature and analyzed to elucidate the roles and ...
Mads K. Plenge +4 more
wiley +1 more source