Results 21 to 30 of about 24,814 (240)

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, Maharshi Ray, Zhen-Peng Xu, Masahito Hayashi, Leong-Chuan Kwek, Adán Cabello   +5 more
doaj   +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., Králʼ, Daniel, Martins, Taísa L.   +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, Cosmin Pohoata, Dmitriy Zakharov   +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, BENNY SUDAKOV, Butterfield, DAVID CONLON, Erdős, Fox, Grytczuk, Hilbert, JACOB FOX, Kowalik, Wallis, Wilson   +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, A. F. Sidorenko, A. F. Sidorenko, A. G. Thomason, A. Grzesik, A. Gyárfás, A. Gyárfás, A. Gyárfás, A. Kostochka, A. Lubotzky, A. Marcus, A. McLennan, A. Scott, A. Sidorenko, A. Thomason, B. Bollobás, B. Bollobás, B. Bollobás, B. Bollobás, B. Bollobás, B. Sudakov, B. Toft, C. Balbuena, C. Balbuena, C. Balbuena, C. Hyltén-Cavallius, C. Jagger, C. R. J. Clapham, C. T. Benson, D. Bienstock, D. Caen de, D. Conlon, D. K. Garnick, D. K. Garnick, D. Kühn, D. M. Cvetkovič, D. Mubayi, D. Piguet, D. R. Woodall, D. R. Woodall, E. Győri, E. Győri, E. Győri, E. Szemerédi, F. Behrend, F. Chung, F. Lazebnik, F. Lazebnik, F. Lazebnik, F. Lazebnik, F. Lazebnik, F. Lazebnik, F. R. K. Chung, G. A. Margulis, G. A. Margulis, G. A. Margulis, G. Fan, G. Fan, G. Megyesi, G. N. Kopylov, G. N. Sárközy, G. Tardos, Gy. Katona, H. Edelsbrunner, H. Hatami, H. Hatami, H. Hatami, I. Reiman, I. Reiman, J. A. Bondy, J. A. Bondy, J. A. Bondy, J. Beck, J. Fox, J. Griggs, J. Kollár, J. Komlós, J. Komlós, J. Pach, J. R. Griggs, J. R. Griggs, J. Shen, J. Spencer, J. Verstraëte, J.-F. Saclè, K. Clarkson, K. Zarankiewicz, K. Čulík, L. Babai, L. Caccetta, L. Lovász, L. Lovász, M. Conder, M. Klazar, M. Molloy, M. Mörs, M. N. Huxley, M. Simonovits, M. Simonovits, M. Simonovits, M. Simonovits, M. Simonovits, M. Simonovits, M. Simonovits, M. Woźniak, N. Alon, N. Alon, N. Alon, N. Alon, N. Alon, O. Cooley, O. Pikhurko, P. Brass, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Erdős, P. Keevash, P. N. Balister, P. N. Balister, P. Turán, P. Turán, P. Turán, P. Turán, R. Baer, R. Canham, R. J. Faudree, R. J. Faudree, R. K. Guy, R. K. Guy, R. M. Wilson, R. Pinchasi, R. R. Singleton, R. Wenger, S. Ball, S. Brandt, S. Hartman, S. Janson, S. Józsa, T. Jiang, T. Jiang, T. Kővári, V. Nikiforov, V. Nikiforov, W. G. Brown, W. G. Brown, W. G. Brown, W. G. Brown, W. G. Brown, W. G. Brown, W. Imrich, W. Mader, W. Mader, W. Mader, Y. Yuansheng, Y. Yuansheng, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Z. Füredi, Znám, Znám   +198 more
core   +1 more source

Finitely forcible graphons with an almost arbitrary structure

Discrete Analysis, 2020
Finitely forcible graphons with an almost arbitrary structure, Discrete Analysis 2020:9, 36 pp. A basic result from the theory of quasirandom graphs, due to Andrew Thomason, is that if $G$ is a graph with $n$ vertices and density $p$, and if the number ...
Daniel Kral, Laszlo Miklos Lovasz, Jonathan Noel, Jakub Sosnovec   +3 more
doaj   +1 more source

An advance in infinite graph models for the analysis of transportation networks

International Journal of Applied Mathematics and Computer Science, 2016
This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph.
Cera Martín, Fedriani Eugenio M.
doaj   +1 more source

Maximum Cycle Packing in Eulerian Graphs Using Local Traces

Discussiones Mathematicae Graph Theory, 2015
For a graph G = (V,E) and a vertex v ∈ V , let T(v) be a local trace at v, i.e. T(v) is an Eulerian subgraph of G such that every walk W(v), with start vertex v can be extended to an Eulerian tour in T(v).
Recht Peter, Sprengel Eva-Maria
doaj   +1 more source

Extremal problems for the p-spectral radius of graphs [PDF]

, 2014
The $p$-spectral radius of a graph $G\ $of order $n$ is defined for any real number $p\geq1$ as \[ \lambda^{\left( p\right) }\left( G\right) =\max\left\{ 2\sum_{\{i,j\}\in E\left( G\right) \ }x_{i}x_{j}:x_{1},\ldots,x_{n}\in\mathbb{R}\text{ and }\left ...
Kang, Liying, Nikiforov, Vladimir
core   +1 more source

Approaching the Rate-Distortion Limit with Spatial Coupling, Belief propagation and Decimation [PDF]

, 2015
We investigate an encoding scheme for lossy compression of a binary symmetric source based on simple spatially coupled Low-Density Generator-Matrix codes.
Aref, Vahid, Macris, Nicolas, Vuffray, Marc   +2 more
core   +2 more sources