Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 2
Tree-independence number of ▫$P_5$▫-free graphs with no large bicliques
Václav Blažej, J. Pascal Gollin, Tomáš Hons, Tomáš Masařík, Martin Milanič, Paweł Rzążewski, Ondřej Suchý, Alexandra Wesolek
Objavljeni znanstveni prispevek na konferenci
Oznake: tree-independence number;independence degeneracy;independence treewidth;P5-free graphs;
The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties, but the parameter can be unbounded eve ...
Leto: 2026 Vir: Repozitorij Univerze na Primorskem (RUP)
ǂA ǂnote on the 2-colored rectilinear crossing number of random point sets in the unit square
Sergio Cabello, Éva Czabarka, Ruy Fabila-Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek
Izvirni znanstveni članek
Oznake: arrangement of points;flat;hyperplane;
Let ▫$S$▫ be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of ▫$S$▫ with a straight line segment. Color these edges red if they have positive slope and blue, otherwise. We show that the probability that ▫$S$▫ defines a pair of crossing edges ...
Leto: 2024 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Št. zadetkov: 2
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: