Zobrazeno 1 - 10
of 2 235
pro vyhledávání: '"Alecu, A."'
Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear clique-width and they are well-quasi-ordered by induced subgraphs. The latter property implies th
Externí odkaz:
http://arxiv.org/abs/2402.12559
Unlike minors, the induced subgraph obstructions to bounded treewidth come in a large variety, including, for every $t\geq 1$, the $t$-basic obstructions: the graphs $K_{t+1}$ and $K_{t,t}$, along with the subdivisions of the $t$-by-$t$ wall and thei
Externí odkaz:
http://arxiv.org/abs/2311.05066
Given an integer $c\geq 1$, we say a graph $G$ is $c$-pinched if $G$ does not contain an induced subgraph consisting of $c$ cycles, all going through a single common vertex and otherwise pairwise disjoint and with no edges between them. What can be s
Externí odkaz:
http://arxiv.org/abs/2309.12227
Treewidth is a fundamental graph parameter that quantifies the complexity of graphs by measuring their "thickness" compared to a tree. In 1986, Robertson and Seymour proved that the only way a graph may have large treewidth is by containing a large h
Externí odkaz:
http://arxiv.org/abs/2309.04390
Autor:
Kevin Kožić, Matthias Hartmann, Ragan M. Callaway, Isabell Hensen, Dávid U. Nagy, Patrik Mráz, Mohammad M. Al-Gharaibeh, Svetlana Bancheva, Alecu Diaconu, Jiří Danihelka, David J. Ensing, Rita Filep, Zigmantas Gudžinskas, Avni Hajdari, Roxana Nicoară, Susanne Lachmuth, Chandra E. Moffat, Andriy Novikov, Dragica Purger, Mandy L. Slate, Agnieszka Synowiec, Ghizela D. Vonica, Annika M. Zuleger, Christoph Rosche
Publikováno v:
NeoBiota, Vol 95, Iss , Pp 309-329 (2024)
The recruitment life stage, including germination and early seedling establishment, is the most vulnerable life stage of plants and has cascading effects on plant performance at later life stages. However, surprisingly little is known on the eco-evol
Externí odkaz:
https://doaj.org/article/211098c11b2149d09956c670c535251c
Autor:
Federico Torta, Nils Hoffmann, Bo Burla, Irina Alecu, Makoto Arita, Takeshi Bamba, Steffany A. L. Bennett, Justine Bertrand-Michel, Britta Brügger, Mónica P. Cala, Dolores Camacho-Muñoz, Antonio Checa, Michael Chen, Michaela Chocholoušková, Michelle Cinel, Emeline Chu-Van, Benoit Colsch, Cristina Coman, Lisa Connell, Bebiana C. Sousa, Alex M. Dickens, Maria Fedorova, Finnur Freyr Eiríksson, Hector Gallart-Ayala, Mohan Ghorasaini, Martin Giera, Xue Li Guan, Mark Haid, Thomas Hankemeier, Amy Harms, Marcus Höring, Michal Holčapek, Thorsten Hornemann, Chunxiu Hu, Andreas J. Hülsmeier, Kevin Huynh, Christina M. Jones, Julijana Ivanisevic, Yoshihiro Izumi, Harald C. Köfeler, Sin Man Lam, Mike Lange, Jong Cheol Lee, Gerhard Liebisch, Katrice Lippa, Andrea F. Lopez-Clavijo, Malena Manzi, Manuela R. Martinefski, Raviswamy G. H. Math, Satyajit Mayor, Peter J. Meikle, María Eugenia Monge, Myeong Hee Moon, Sneha Muralidharan, Anna Nicolaou, Thao Nguyen-Tran, Valerie B. O’Donnell, Matej Orešič, Arvind Ramanathan, Fabien Riols, Daisuke Saigusa, Tracey B. Schock, Heidi Schwartz-Zimmermann, Guanghou Shui, Madhulika Singh, Masatomo Takahashi, Margrét Thorsteinsdóttir, Noriyuki Tomiyasu, Anthony Tournadre, Hiroshi Tsugawa, Victoria J. Tyrrell, Grace van der Gugten, Michael O. Wakelam, Craig E. Wheelock, Denise Wolrab, Guowang Xu, Tianrun Xu, John A. Bowden, Kim Ekroos, Robert Ahrends, Markus R. Wenk
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-15 (2024)
Abstract In this community effort, we compare measurements between 34 laboratories from 19 countries, utilizing mixtures of labelled authentic synthetic standards, to quantify by mass spectrometry four clinically used ceramide species in the NIST (Na
Externí odkaz:
https://doaj.org/article/e8653562ef70466097f27cb7fad363e8
Induced subgraphs and tree decompositions X. Towards logarithmic treewidth for even-hole-free graphs
A generalized $t$-pyramid is a graph obtained from a certain kind of tree (a subdivided star or a subdivided cubic caterpillar) and the line graph of a subdivided cubic caterpillar by identifying simplicial vertices. We prove that for every integer $
Externí odkaz:
http://arxiv.org/abs/2307.13684
Autor:
Abrishami, Tara, Alecu, Bogdan, Chudnovsky, Maria, Hajebi, Sepehr, Spirkl, Sophie, Vušković, Kristina
The tree-independence number tree-$\alpha$, first defined and studied by Dallard, Milani\v{c} and \v{S}torgel, is a variant of treewidth tailored to solving the maximum independent set problem. Over a series of papers, Abrishami et al. developed the
Externí odkaz:
http://arxiv.org/abs/2305.16258
The celebrated Erd\H{o}s-P\'{o}sa Theorem, in one formulation, asserts that for every $c\geq 1$, graphs with no subgraph (or equivalently, minor) isomorphic to the disjoint union of $c$ cycles have bounded treewidth. What can we say about the treewid
Externí odkaz:
http://arxiv.org/abs/2305.15615
How to efficiently represent a graph in computer memory is a fundamental data structuring question. In the present paper, we address this question from a combinatorial point of view. A representation of an $n$-vertex graph $G$ is called implicit if i
Externí odkaz:
http://arxiv.org/abs/2303.04453