Results 41 to 50 of about 270,762 (116)

Positive Co‐Degree Turán Number for C5 and C5−

open access: yesJournal of Graph Theory, Volume 109, Issue 1, Page 25-30, May 2025.
ABSTRACT The minimum positive co‐degree δ r − 1 + ( H ) \unicode{x003B4}r\unicode{x02212}1\unicode{x0002B}
Zhuo Wu
wiley   +1 more source

Brief Lecture Notes on Self-Referential Mathematics, and Beyond [PDF]

open access: yesarXiv, 2009
Recently delivered lectures on Self-Referential Mathematics, [2], at the Department of Mathematics and Applied Mathematics, University of Pretoria, are briefly presented. Comments follow on the subject, as well as on Inconsistent Mathematics.
arxiv  

TO TEACH COMBINATORICS, USING SELECTED PROBLEMS [PDF]

open access: yes, 2012
In 1972, professor Grigore Moisil, the most famous Romanian academician for Mathematics, said about Combinatorics, that it is “an opportunity of a renewed gladness”, because “each problem in the domain asks for its solving, an expenditure without any ...
Modan, Laurentiu
core   +1 more source

New Families of Strength‐3 Covering Arrays Using Linear Feedback Shift Register Sequences

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 4, Page 156-171, April 2025.
ABSTRACT In an array over an alphabet of v symbols, a t‐set of column indices { c 1 , … , c t } is covered if each t‐tuple of the alphabet occurs at least once as a row of the sub‐array indexed by c 1 , … , c t. A covering array, denoted by CA( N ; t , k , v ), is an N × k array over an alphabet with v symbols with the property that any t‐set of ...
Kianoosh Shokri, Lucia Moura
wiley   +1 more source

On the Pre‐ and Post‐Positional Semi‐Random Graph Processes

open access: yesJournal of Graph Theory, Volume 108, Issue 4, Page 819-831, April 2025.
ABSTRACT We study the semi‐random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi‐random graph G $G$ that has property P ${\mathscr{P}}$, for the following examples of P ${\mathscr{P}}$: (1) P ${\mathscr{P}}$ is the set of graphs containing ...
Pu Gao, Hidde Koerts
wiley   +1 more source

Categories without structures [PDF]

open access: yesarXiv, 2009
The popular view according to which Category theory provides a support for Mathematical Structuralism is erroneous. Category-theoretic foundations of mathematics require a different philosophy of mathematics. While structural mathematics studies invariant forms (Awodey) categorical mathematics studies covariant transformations which, generally, don t ...
arxiv  

Mathematical modeling for sustainability: How can it promote sustainable learning in mathematics education? [PDF]

open access: yesarXiv, 2023
This article reviews the current state of teaching and learning mathematical modeling in the context of sustainable development goals for education at the tertiary level. While ample research on mathematical modeling education and published textbooks on the topic are available, there is a lack of focus on mathematical modeling for sustainability.
arxiv  

Analogues Between Leibniz\u27s Harmonic Triangle and Pascal\u27s Arithmetic Triangle [PDF]

open access: yes, 2019
This paper will discuss the analogues between Leibniz\u27s Harmonic Triangle and Pascal\u27s Arithmetic Triangle by utilizing mathematical proving techniques like partial sums, committees, telescoping, mathematical induction and applying George Polya ...
James, Lacey Taylor
core   +1 more source

On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph

open access: yesJournal of Graph Theory, Volume 108, Issue 4, Page 817-818, April 2025.
ABSTRACT Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion‐wise minimal vertex cuts in a graph on n $n$ vertices is at most 1.889 9 n $1.889{9}^{n}$ for large enough n $n$.
Domagoj Bradač
wiley   +1 more source

Instantons: topological aspects [PDF]

open access: yesEnclyclopedia of Mathematical Physics vol. 2 (2006) 44-50, 2005
Short survey to be published at the Encyclopedia of Mathematical Physics.
arxiv  

Home - About - Disclaimer - Privacy