Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Nathan Lindzey"'
Autor:
Nathan Lindzey
Publikováno v:
European Journal of Combinatorics. 65:130-142
A perfect matching of a complete graph K 2 n is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if F is family of intersecting perfect matchings of K 2 n , then | F | ≤ (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a93f6db306bb64d73f44982e2486701b
https://doi.org/10.1016/j.ejc.2017.05.005
https://doi.org/10.1016/j.ejc.2017.05.005
Autor:
Nathan Lindzey, Ansis Rosmanis
The Index-Erasure problem is a quantum state generation problem that asks a quantum computer to prepare a uniform superposition over the image of an injective function given by an oracle. We prove a tight $\Omega(\sqrt{n})$ lower bound on the quantum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b91fd765a766eeb08d985d332858bc5
Autor:
Pinar Heggernes, Jayme Luiz Szwarcfiter, Petr A. Golovach, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Nathan Lindzey
Publikováno v:
Discrete Applied Mathematics. 216:171-180
A graph G = ( V , E ) is a threshold tolerance graph if each vertex v ∈ V can be assigned a weight w v and a tolerance t v such that two vertices x , y ∈ V are adjacent if w x + w y ≥ min ( t x , t y ) . Currently, the most efficient recognitio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::775946b4bc4e0785c44610e363c08fa7
https://doi.org/10.1016/j.dam.2015.01.034
https://doi.org/10.1016/j.dam.2015.01.034
Autor:
Nathan Lindzey
Publikováno v:
European Journal of Combinatorics. 86:103091
A family of perfect matchings of K 2 n is intersecting if any two of its members have an edge in common. It is known that if F is a family of intersecting perfect matchings of K 2 n , then | F | ⩽ ( 2 n − 3 ) ! ! and if equality holds, then F = F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d7343907ba34bd3ff1d4c11c1894692
https://doi.org/10.1016/j.ejc.2020.103091
https://doi.org/10.1016/j.ejc.2020.103091
We consider the algebraic combinatorics of the set of injections from a $k$-element set to an $n$-element set. In particular, we give a new combinatorial formula for the spherical functions of the Gelfand pair $(S_k \times S_n, \text{diag}(S_k) \time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17005b2f1bb0a5401d1e8d48c6871005
Autor:
Nathan Lindzey
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319193144
IWOCA
IWOCA
Given a graph G, a vertex switch of \(v \in V(G)\) results in a new graph where neighbors of v become nonneighbors and vice versa. This operation gives rise to an equivalence relation over the set of labeled digraphs on n vertices. The equivalence cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b8cae27dab50fa6d3830a09271dcd1d
https://doi.org/10.1007/978-3-319-19315-1_21
https://doi.org/10.1007/978-3-319-19315-1_21
Autor:
Nathan Lindzey, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Pinar Heggernes, Ross M. McConnell, Petr A. Golovach
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783319123394
WG
WG
A graph \(G = (V,E)\) is a threshold tolerance graph if each vertex \(v \in V\) can be assigned a weight \(w_v\) and a tolerance \(t_v\) such that two vertices \(x,y \in V\) are adjacent if \(w_x + w_y \ge \min (t_x,t_y)\). Currently, the most effici
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8dcc2efad0feada37c62dd1f395a3937
https://doi.org/10.1007/978-3-319-12340-0_18
https://doi.org/10.1007/978-3-319-12340-0_18
Autor:
Ross M. McConnell, Nathan Lindzey
Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a linear-time algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal forbidden submatr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::966e883ae10a990bf6d311736de636f8
Autor:
Nathan Lindzey, Ross M. McConnell
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783642450426
WG
WG
Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a linear-time algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal forbidden submatr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7c0eecccda3f673ce7ace44178dc11c
https://doi.org/10.1007/978-3-642-45043-3_30
https://doi.org/10.1007/978-3-642-45043-3_30
A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. Given a digraph G, a partially complemented digraph G ź is a digraph obtained from G by performing a sequence of vertex co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4570c2ec81dcf58438513be04a90c4c5