31 research outputs found
Paragênese mineral de solos desenvolvidos de diferentes litologias na região sul de Minas Gerais
Full text linkOrchestrating Mathematical Classroom Discourse About Various Solution Methods: Case Study of a Teacher’s Development
No full textContains fulltext :
216038pub.pdf (publisher's version ) (Open Access
Building on student mathematical thinking in whole-class discourse: exploring teachers' in-the-moment decision-making, interpretation, and underlying conceptions
Get PDFContains fulltext :
242931.pdf (Publisher’s version ) (Open Access)28 mei 202125 p
‘Second‐generation’ MVs and the evolution of the Green Revolution: the case of Central Luzon, 1966–90
No full textThe nonrandom selection of don't knows in binary and ordinal responses: Corrections with the bivariate probit model with sample selection
No full text
Large Independent Sets in Triangle-Free Planar Graphs
No full textEvery triangle-free planar graph on n vertices has an independent set of size
at least (n+1)/3, and this lower bound is tight. We give an algorithm that,
given a triangle-free planar graph G on n vertices and an integer k>=0, decides
whether G has an independent set of size at least (n+k)/3, in time
2^{O(sqrt{k})}n. Thus, the problem is fixed-parameter tractable when
parameterized by k. Furthermore, as a corollary of the result used to prove the
correctness of the algorithm, we show that there exists epsilon>0 such that
every planar graph of girth at least five on n vertices has an independent set
of size at least n/(3-epsilon).Comment: 14 pages, 1 figur
