Results 71 to 80 of about 934 (196)
Kneser graphs are like Swiss cheese
Discrete Analysis, 2018 Kneser graphs are like Swiss cheese, Discrete Analysis 2018:2, 18 pp. This paper relates two very interesting areas of research in extremal combinatorics: removal lemmas, and influence of variables.
Ehud Friedgut, Oded Regev
doaj +1 more source
Data‐Driven Review and Machine Learning Prediction of Diamond Vacancy Center Synthesis
Advanced Intelligent Systems, Volume 8, Issue 5, May 2026.A machine learning framework is applied to photoluminescence spectra to extract linewidths and uncover how NV, SiV, GeV, and SnV centers evolve with growth and processing conditions. Unified normalization and k‐fold validation reveal cross‐method trends and enable rapid prediction of defect size and fabrication parameters, offering a data‐driven route ...
Zhi Jiang +3 more
wiley +1 more source
Extensions of Classic Theorems in Extremal Combinatorics [PDF]
, 2014 Extremal combinatorics deals with the following fundamental question: how large can a structure be without containing forbidden configurations? The structures studied are extremely flexible, allowing for a wide range of applications to diverse fields ...
Das, Shagnik
core
Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory
, 2015 In this dissertation, we treat several problems in Ramsey theory, probabilistic combinatorics and extremal graph ...
core +1 more source
On Regular Quaternary Hadamard Matrices
Journal of Combinatorial Designs, Volume 34, Issue 5, Page 215-227, May 2026.ABSTRACT Through the use of regularizing vectors, all regular quaternary Hadamard matrices of orders 10 and 18 have been successfully identified. Of these, two matrices of order 10 and 184 matrices of order 18 were found to have unbiased mates. Converting the quaternary Hadamard matrices of order 18 to real Hadamard matrices, the study uncovered that ...
Hadi Kharaghani +2 more
wiley +1 more source
Two‐Round Ramsey Games on Random Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a single‐player game whose goal is to colour the edges of a random graph, in an online fashion, so as not to create a monochromatic triangle.
Yahav Alon +2 more
wiley +1 more source
Several Problems in Extremal Combinatorics [PDF]
, 2014 Extremal combinatorics is one of the central branches of discrete mathematics. It focuses on determining or estimating the optimal possible size of a discrete structure(e.g. set systems, graphs) with certain properties.
Gan, Wenying
core
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley +1 more source
An identity in combinatorial extremal theory
, 1990 Ahlswede R, Zhang Z. An identity in combinatorial extremal theory. Advances in Mathematics.
Zhang, Zhen +3 more
core +1 more source
Earth and Space Science, Volume 13, Issue 5, May 2026.Abstract This paper summarizes an evaluation by experts of how coordination of Earth‐observing Synthetic Aperture Radar (SAR) missions among the world's space agencies could advance toward game‐changing scientific discoveries and fully realizing SAR's practical capability to address many issues facing society.
Cathleen E. Jones +21 more
wiley +1 more source