Constructing Tree Decompositions of Graphs with Bounded Gonality

Autor: Bodlaender, Hans L., van Dobben de Bruyn, J., Gijswijt, D.C., Smit, Harry, Kim, Donghyun, Uma, R.N., Cai, Zhipeng, Lee, Dong Hoon

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030581497
COCOON
Computing and Combinatorics: 26th International Conference, COCOON 2020, Proceedings
Computing and Combinatorics

In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most k, when an effective divisor of d

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2a2259c7bfc5bf6f78a4f7aeff8105a
https://doi.org/10.1007/978-3-030-58150-3_31

On large subsets of Fnq with no three-termarithmetic progression

Autor: Ellenberg, Jordan S., Gijswijt, D.C.

Publikováno v: Annals of Mathematics, 185(1)

In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a subset of F n q Fqn with no three terms in arithmetic progression by c n cn with ccap set problem. Previously the best known upper bound for the affine c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::76a3e1e20c1394cd2fb87bc555705b57
http://resolver.tudelft.nl/uuid:24934b91-cb43-49ef-9423-731dd1fb9306

Matrix algebras and semidefinite programming techniques for codes

Autor: Gijswijt, D.C.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::496239e3d6d42b0fb3e1e08082c3f0a7
https://dare.uva.nl/personal/pure/en/publications/matrix-algebras-and-semidefinite-programming-techniques-for-codes(032593d8-9f15-4f57-a288-627fb55effae).html

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.