Results 21 to 30 of about 98,708 (229)
, 2004 This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works.
Aeppli +70 more
core +5 more sources
Rainbow perfect matchings in r-partite graph structures [PDF]
, 2016 A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite ...
Cano Vila, María del Pilar +2 more
core +2 more sources
Unimodality Problems in Ehrhart Theory
, 2017 Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart $h^*$-vector. Ehrhart $h^*
A. Stapledon +45 more
core +1 more source
Poset topology and homological invariants of algebras arising in algebraic combinatorics [PDF]
, 2013 We present a beautiful interplay between combinatorial topology and homological algebra for a class of monoids that arise naturally in algebraic combinatorics. We explore several applications of this interplay.
Margolis, Stuart +2 more
core +4 more sources
Some remarks on multiplicity codes
, 2014 Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives.
Kopparty, Swastik
core +1 more source
On 3‐Designs From P G L ( 2 , q ) $PGL(2,q)$
Journal of Combinatorial Designs, EarlyView.ABSTRACT The group P G L ( 2 , q ) $PGL(2,q)$ acts 3‐transitively on the projective line G F ( q ) ∪ { ∞ } $GF(q)\cup \{\infty \}$. Thus, an orbit of its action on the k $k$‐subsets of the projective line is the block set of a 3‐ ( q + 1 , k , λ ) $(q+1,k,\lambda )$ design.
Paul Tricot
wiley +1 more source
A Study On Combinatorics Indiscrete Mathematics
, 2018 {"references": ["1.\tArumugam. S & Isaac. A. T, \"Modern Algebra\", Scitech Publications Pvt. Ltd, Chennai. 2.\tLiu. C. L \"Elements of Discrete Mathematics\", MC Graw Hill, Internation Edition. 3.\tTremblay. J. P & Manohar. R, \"Discrete Mathematics Structure with application to computer science\", TMH Edition 1007. 4.\tVeerarajan.
G. Rajkumar, Dr. V. Ramadoss
openaire +2 more sources
Completing Partial k $k$ ‐Star Designs
Journal of Combinatorial Designs, EarlyView.ABSTRACT A k $k$ ‐star is a complete bipartite graph K 1 , k ${K}_{1,k}$ . A partial k $k$ ‐star design of order n $n$ is a pair ( V , A ) $(V,{\mathscr{A}})$ where V $V$ is a set of n $n$ vertices and A ${\mathscr{A}}$ is a set of edge‐disjoint k $k$ ‐stars whose vertex sets are subsets of V $V$ .
Ajani De Vas Gunasekara, Daniel Horsley
wiley +1 more source
Dominating Kt ${K}_{t}$‐Models
Journal of Graph Theory, EarlyView.ABSTRACT A dominating Kt ${K}_{t}$‐model in a graph G $G$ is a sequence (T1,…,Tt) $({T}_{1},\ldots ,{T}_{t})$ of pairwise disjoint non‐empty connected subgraphs of G $G$, such that for 1⩽i
Freddie Illingworth, David R. Wood
wiley +1 more source
Generalisation : graphs and colourings [PDF]
, 2020 The interaction between practice and theory in mathematics is a central theme. Many mathematical structures and theories result from the formalisation of a real problem. Graph Theory is rich with such examples.
Zarb, Christina
core