Results 161 to 170 of about 63,637 (247)
Bipartite induced subgraphs and well-quasi-ordering [PDF]
Nicholas Korpelainen, Vadim Lozin
openalex +1 more source
Bounded projections to the Z$\mathcal {Z}$‐factor graph
Abstract Suppose that G$G$ is a free product G=A1∗A2∗⋯∗Ak∗FN$G = A_1 * A_2* \cdots * A_k * F_N$, where each of the groups Ai$A_i$ is torsion‐free and FN$F_N$ is a free group of rank N$N$. Let O$\mathcal {O}$ be the deformation space associated to this free product decomposition. We show that the diameter of the projection of the subset of O$\mathcal {O}
Matt Clay, Caglar Uyanik
wiley +1 more source
Letter graphs and well-quasi-order by induced subgraphs
Marko Petkovšek
openalex +1 more source
Induced subgraphs of Ramsey graphs with many distinct degrees
Boris Bukh, Benny Sudakov
openalex +1 more source
Large components in random induced subgraphs of n-cubes
Christian M. Reidys
openalex +2 more sources
The induced matching and chain subgraph cover problems for convex bipartite graphs
Andreas Brandstädt+2 more
openalex +1 more source
Maximum triangle-free induced subgraph
A clever idea is frequently necessarily the key to solve mathematics problems from Prasolov books. Modern mathematics, especially the theory of NP-completeness starting from the classical book of [1], also gradually moves forward similarly. Continuing the years-long tale of that theory, we add another result claiming the hardness of one more problem ...
openaire +2 more sources
Parameterized complexity of finding regular induced subgraphs
Hannes Moser, Dimitrios M. Thilikos
openalex +1 more source
Rigidity of Symmetric Frameworks on the Cylinder. [PDF]
Nixon A, Schulze B, Wall J.
europepmc +1 more source