UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A simple proof of the Zeilberger--Bressoud q-Dyson theorem

Proceedings of the American Mathematical Society, 2014-09, Vol.142 (9), p.3007-3011

2014

Volltextzugriff (PDF)

Partitioning the projective plane into two incidence‐rich parts

Journal of combinatorial designs, 2024-12, Vol.32 (12), p.703-714

Nagy, Zoltán Lóránt

2024

Volltextzugriff (PDF)

Avoiding intersections of given size in finite affine spaces AG(n,2)

Journal of combinatorial theory. Series A, 2025-01, Vol.209, p.105959, Article 105959

2025

Volltextzugriff (PDF)

Multicolor Turán numbers II: A generalization of the Ruzsa–Szemerédi theorem and new results on cliques and odd cycles

Journal of graph theory, 2024-11, Vol.107 (3), p.629-641

2024

Volltextzugriff (PDF)

The Turán number of blow-ups of trees

Journal of combinatorial theory. Series B, 2022-09, Vol.156, p.299-309

2022

Volltextzugriff (PDF)

Generalised outerplanar Turán numbers and maximum number of k-vertex subtrees

Discrete Applied Mathematics, 2022-01, Vol.307, p.115-124

2022

Volltextzugriff (PDF)

Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz

Designs, codes, and cryptography, 2022-09, Vol.90 (9), p.1991-2001

2022

Volltextzugriff (PDF)

Coupon-Coloring and Total Domination in Hamiltonian Planar Triangulations

Graphs and combinatorics, 2018-11, Vol.34 (6), p.1385-1394

Nagy, Zoltán Lóránt

2018

Volltextzugriff (PDF)

Saturating sets in projective planes and hypergraph covers

Discrete mathematics, 2018-04, Vol.341 (4), p.1078-1083

Nagy, Zoltán Lóránt

2018

Volltextzugriff (PDF)

Supersaturation of C 4 : From Zarankiewicz towards Erdős–Simonovits–Sidorenko

European journal of combinatorics, 2019-01, Vol.75, p.19-31

Nagy, Zoltán Lóránt

2019

Volltextzugriff (PDF)

The extensible No-Three-In-Line problem

European journal of combinatorics, 2023-12, Vol.114, p.103796, Article 103796

2023

Volltextzugriff (PDF)

Steiner triple systems and spreading sets in projective spaces

Journal of combinatorial designs, 2022-08, Vol.30 (8), p.549-560

2022

Volltextzugriff (PDF)

On the Number of k‐Dominating Independent Sets

Journal of graph theory, 2017-04, Vol.84 (4), p.566-580

Nagy, Zoltán Lóránt

2017

Volltextzugriff (PDF)

A Note on Internal Partitions: The 5-Regular Case and Beyond

Graphs and combinatorics, 2024-04, Vol.40 (2), Article 36

2024

Volltextzugriff (PDF)

Unified approach to the generalized Turán problem and supersaturation

Discrete mathematics, 2022-03, Vol.345 (3), p.112743, Article 112743

2022

Volltextzugriff (PDF)

Avoider-enforcer star games

Discrete mathematics and theoretical computer science, 2015-01, Vol.17 no. 1 (Combinatorics), p.145-160

2015

Volltextzugriff (PDF)

Spreading linear triple systems and expander triple systems

European journal of combinatorics, 2020-10, Vol.89, p.103155, Article 103155

2020

Volltextzugriff (PDF)

On the balanced upper chromatic number of finite projective planes

Discrete mathematics, 2021-03, Vol.344 (3), p.112266, Article 112266

2021

Volltextzugriff (PDF)

Transversals in generalized Latin squares

Ars mathematica contemporanea, 2019-01, Vol.16 (1), p.39-47, Article 39

2019

Volltextzugriff (PDF)

Triangle areas in line arrangements

Discrete mathematics, 2020-12, Vol.343 (12), p.112105, Article 112105

2020

Volltextzugriff (PDF)

A new approach to constant term identities and Selberg-type integrals

Advances in mathematics (New York. 1965), 2015-06, Vol.277, p.252-282

2015

Volltextzugriff (PDF)

Permutations over cyclic groups

European journal of combinatorics, 2014-10, Vol.41, p.68-78

Nagy, Zoltán Lóránt

2014

Volltextzugriff (PDF)

Partition dimension of projective planes

European journal of combinatorics, 2017-10, Vol.65, p.37-44

2017

Volltextzugriff (PDF)

Dominating Sets in Projective Planes

Journal of combinatorial designs, 2017-07, Vol.25 (7), p.293-309

2017

Volltextzugriff (PDF)

On the Number of Maximal Intersecting $k$-Uniform Families and Further Applications of Tuza's Set Pair Method

The Electronic journal of combinatorics, 2015-03, Vol.22 (1)

2015

Volltextzugriff (PDF)

1 – 25 von 55

Menü

Weitere Dienste

Einstellungen

A simple proof of the Zeilberger--Bressoud q-Dyson theorem

Partitioning the projective plane into two incidence‐rich parts

Avoiding intersections of given size in finite affine spaces AG(n,2)

Multicolor Turán numbers II: A generalization of the Ruzsa–Szemerédi theorem and new results on cliques and odd cycles

The Turán number of blow-ups of trees

Generalised outerplanar Turán numbers and maximum number of k-vertex subtrees

Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz

Coupon-Coloring and Total Domination in Hamiltonian Planar Triangulations

Saturating sets in projective planes and hypergraph covers

Supersaturation of C 4 : From Zarankiewicz towards Erdős–Simonovits–Sidorenko

The extensible No-Three-In-Line problem

Steiner triple systems and spreading sets in projective spaces

On the Number of k‐Dominating Independent Sets

A Note on Internal Partitions: The 5-Regular Case and Beyond

Unified approach to the generalized Turán problem and supersaturation

Avoider-enforcer star games

Spreading linear triple systems and expander triple systems

On the balanced upper chromatic number of finite projective planes

Transversals in generalized Latin squares

Triangle areas in line arrangements

A new approach to constant term identities and Selberg-type integrals

Permutations over cyclic groups

Partition dimension of projective planes

Dominating Sets in Projective Planes

On the Number of Maximal Intersecting $k$-Uniform Families and Further Applications of Tuza's Set Pair Method

Aktive Filter

Suchergebnisse filtern