X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (12) 12
hajnal-szemeredi theorem (10) 10
proof (7) 7
conjecture (6) 6
mathematics, applied (6) 6
tiling (6) 6
version (6) 6
graphs (5) 5
hajnal-szemeredi (5) 5
regularity (5) 5
regularity lemma (5) 5
hajnal–szemerédi (4) 4
multipartite (4) 4
combinatorics (3) 3
complete 3-graph on 4 vertices (3) 3
graph packing (3) 3
graph theory (3) 3
hajnal-szemerédi (3) 3
hypergraph codegree (3) 3
hypergraph matching (3) 3
linear programming (3) 3
discrete mathematics and combinatorics (2) 2
engineering design (2) 2
graph (2) 2
h-factors (2) 2
hajnal-szemerédi theorem (2) 2
hamilton cycles (2) 2
hypergraphs (2) 2
large minimum degree (2) 2
lemma (2) 2
mathematics - combinatorics (2) 2
multipartite version (2) 2
packing (2) 2
perfect matchings (2) 2
theoretical computer science (2) 2
05c35 (1) 1
05c70 (1) 1
3-uniform hypergraphs (1) 1
absorbing method (1) 1
absorption (1) 1
algorithms (1) 1
alon-yuster (1) 1
alon–yuster (1) 1
asymptotic properties (1) 1
bipartite graph (1) 1
blow-up lemma (1) 1
college teachers (1) 1
computational theory and mathematics (1) 1
computer science (1) 1
computer science, software engineering (1) 1
covering and packing (1) 1
dense graphs (1) 1
discrete mathematics (1) 1
extremal problems (1) 1
factorization (1) 1
k-uniform hypergraphs (1) 1
kuhn-osthus (1) 1
kühn-osthus (1) 1
matching (1) 1
matching, partitioning, covering and packing (1) 1
mathematical analysis (1) 1
multipartite form of the hajnal-szemeredi theorem (1) 1
multipartite form of the hajnal-szemerédi theorem (1) 1
multipartite form of the hajnal–szemerédi theorem (1) 1
partitioning (1) 1
partitions (1) 1
probabilistic methods (1) 1
qa mathematics (1) 1
reproduction (1) 1
settling (1) 1
theorems (1) 1
triangles (1) 1
uniform hypergraphs (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Mathematics, ISSN 0012-365X, 05/2013, Volume 313, Issue 10, pp. 1119 - 1129
Let G be a k-partite graph with n vertices in parts such that each vertex is adjacent to at least δ∗(G) vertices in each of the other parts. Magyar and Martin... 
Graph packing | Absorbing method | Hajnal–Szemerédi | Hajnal-Szemerédi | Hajnal-Szemeredi | MATHEMATICS | VERSION | PROOF
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2008, Volume 308, Issue 19, pp. 4337 - 4360
Let G be a quadripartite graph with N vertices in each vertex class and each vertex is adjacent to at least ( 3 4 ) N vertices in each of the other classes.... 
Graph packing | Regularity lemma | Hajnal–Szemerédi | Hajnal-Szemerédi | Hajnal-Szemeredi | MATHEMATICS | Regularity Lemma | graph packing
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 11/2017, Volume 127, pp. 32 - 52
In this paper, we prove the asymptotic multipartite version of the Alon–Yuster theorem, which is a generalization of the Hajnal–Szemerédi theorem: If k≥3 is an... 
Linear programming | Tiling | Multipartite | Alon–Yuster | Regularity | Hajnal–Szemerédi | Hajnal-Szemeredi | GRAPH | MATHEMATICS | Alon-Yuster | HAJNAL-SZEMEREDI THEOREM | PROOF | College teachers
Journal Article
by Li, LN and Molla, T
ELECTRONIC JOURNAL OF COMBINATORICS, ISSN 1077-8926, 10/2019, Volume 26, Issue 4
Both Cuckler and Yuster independently conjectured that when n is an odd positive multiple of 3 every regular tournament on n vertices contains a collection of... 
MATHEMATICS | MATHEMATICS, APPLIED | HAJNAL-SZEMEREDI THEOREM | PERFECT MATCHINGS | MULTIPARTITE VERSION | PACKING | GRAPHS
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2017, Volume 31, Issue 3, pp. 1498 - 1513
Journal Article
Random Structures & Algorithms, ISSN 1042-9832, 12/2016, Volume 49, Issue 4, pp. 669 - 693
ABSTRACT The classical Corrádi‐Hajnal theorem claims that every n‐vertex graph G with δ(G)≥2n/3 contains a triangle factor, when 3|n. In this paper we present... 
probabilistic methods | matching, partitioning, covering and packing | factorization | extremal problems | MATHEMATICS, APPLIED | HYPERGRAPHS | covering and packing | matching | CONJECTURE | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | HAJNAL-SZEMEREDI THEOREM | VERSION | partitioning | Graphs | Theorems | Algorithms | Absorption | Asymptotic properties | Triangles | Settling | Graph theory
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 03/2012, Volume 102, Issue 2, pp. 395 - 410
Let q be a positive integer, and G be a q-partite simple graph on qn vertices, with n vertices in each vertex class. Let δ=kk+1, where k=q+O(logq). If each... 
Regularity Lemma | Multipartite form of the Hajnal–Szemerédi theorem | Multipartite form of the Hajnal-Szemerédi theorem | MATHEMATICS | Multipartite form of the Hajnal-Szemeredi theorem
Journal Article
SIAM JOURNAL ON DISCRETE MATHEMATICS, ISSN 0895-4801, 2017, Volume 31, Issue 3, pp. 1498 - 1513
In this paper we prove an asymptotic multipartite version of a well-known theorem of Kuhn and Osthus by establishing, for any graph H with chromatic number r,... 
GRAPH | MATHEMATICS, APPLIED | Kuhn-Osthus | tiling | PROOF | linear programming | REGULARITY LEMMA | regularity | CONJECTURE | Hajnal-Szemeredi | multipartite | K-UNIFORM HYPERGRAPHS | HAJNAL-SZEMEREDI THEOREM | VERSION | PACKING
Journal Article
Memoirs of the American Mathematical Society, ISSN 0065-9266, 01/2015, Volume 223, Issue 1198, pp. 1 - 95
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect... 
Hypergraphs | Perfect matchings | HAMILTON CYCLES | MATHEMATICS | 3-UNIFORM HYPERGRAPHS | perfect matchings | HAJNAL-SZEMEREDI THEOREM | hypergraphs | LARGE MINIMUM DEGREE | REGULARITY | LEMMA | VERSION | UNIFORM HYPERGRAPHS | GRAPHS
Journal Article
FORUM OF MATHEMATICS SIGMA, ISSN 2050-5094, 02/2018, Volume 6
The Hajnal-Szemeredi theorem states that for any positive integer r and any multiple n of r, if G is a graph on n vertices and delta(G) >= (1 - 1/r)n, then G... 
MATHEMATICS | MATHEMATICS, APPLIED | PROOF | HAJNAL-SZEMEREDI THEOREM | CONJECTURE | Graph theory | Tiling
Journal Article
GRAPHS AND COMBINATORICS, ISSN 0911-0119, 09/2008, Volume 24, Issue 4, pp. 391 - 404
For a k-graph F, let t(l) (n, m, F) be the smallest integer t such that every k-graph G on n vertices in which every l-set of vertices is included in at least... 
HAMILTON CYCLES | MATHEMATICS | complete 3-graph on 4 vertices | LARGE MINIMUM DEGREE | hypergraph codegree | hypergraph matching | Hajnal-Szemeredi Theorem
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2009, Volume 23, Issue 2, pp. 888 - 900
For each s >= 2, there exists m(0) such that the following holds for all m >= m(0): Let G be a bipartite graph with n = ms vertices in each partition set. If m... 
Blow-up lemma | Tiling | Graph packing | Regularity lemma | regularity lemma | blow-up lemma | MATHEMATICS, APPLIED | graph packing | HAJNAL-SZEMEREDI THEOREM | tiling | LEMMA | VERSION | PROOF | CONJECTURE | Graphs | Partitions | Reproduction | Mathematical analysis
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 08/2009, Volume 16, Issue 1
For any positive real number gamma and any positive integer h, there is N-0 such that the following holds. Let N >= N-0 be such that N is divisible by h. If G... 
MATHEMATICS | DENSE GRAPHS | MATHEMATICS, APPLIED | HAJNAL-SZEMEREDI THEOREM | H-FACTORS | VERSION | PROOF | REGULARITY LEMMA | BIPARTITE GRAPH | CONJECTURE
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 9/2018, Volume 34, Issue 5, pp. 1049 - 1075
There is a sufficiently large $$N\in h{\mathbb {N}}$$ N∈hN such that the following holds. If G is a tripartite graph with N vertices in each vertex class such... 
Multipartite | Mathematics | Tiling | 05C70 | Engineering Design | Combinatorics | Regularity | 05C35 | Hajnal–Szemerédi | Hajnal-Szemeredi | MATHEMATICS | HAJNAL-SZEMEREDI THEOREM | H-FACTORS | MULTIPARTITE VERSION | PROOF | CONJECTURE | Graphs | Graph theory | Mathematics - Combinatorics
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 09/2008, Volume 24, Issue 4, pp. 391 - 404
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 9/2008, Volume 24, Issue 4, pp. 391 - 404
For a k-graph F, let t l (n, m, F) be the smallest integer t such that every k-graph G on n vertices in which every l-set of vertices is included in at least t... 
Complete 3-graph on 4 vertices | hypergraph codegree | Mathematics | Engineering Design | Combinatorics | hypergraph matching | Hajnal-Szemerédi Theorem
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.