Results 21 to 30 of about 25,547 (250)
Guessing Numbers and Extremal Graph Theory [PDF]
Electronic Journal of Combinatorics, 2020 For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph such that the color of each vertex can be determined from the colors of the
J. Martin, Puck Rombach
semanticscholar +1 more source
Extremal aspects of graph and hypergraph decomposition problems [PDF]
BCC, 2020 We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of intriguing open problems, and formulate new ones.
Stefan Glock, D. Kühn, Deryk Osthus
semanticscholar +1 more source
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
AKCE International Journal of Graphs and Combinatorics, 2018 The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources
Hypergraphs with infinitely many extremal constructions
Discrete Analysis, 2023 Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
Graph-Theoretic Approach for Self-Testing in Bell Scenarios
PRX Quantum, 2022 Self-testing is a technology to certify states and measurements using only the statistics of the experiment. Self-testing is possible if some extremal points in the set B_{Q} of quantum correlations for a Bell experiment are achieved, up to isometries ...
Kishor Bharti +5 more
doaj +1 more source
Solving Some Graph Problems in Composite 3D Printing Using Spreadsheet Modeling
Journal of Composites Science, 2023 The use of composite materials in additive manufacturing has significant potential and prospects for development. However, the 3D printing of composite materials also has some challenges, such as tool path planning and optimization, material distribution
L. Hlinenko +9 more
semanticscholar +1 more source
Finitely forcible graph limits are universal [PDF]
, 2018 The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly within ...
Cooper, Jacob W. +2 more
core +3 more sources
Random multilinear maps and the Erdős box problem
Discrete Analysis, 2021 Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon +2 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
The history of degenerate (bipartite) extremal graph problems [PDF]
, 2013 This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and constructions.
A. A. Razborov +198 more
core +1 more source