Extremal eigenvalues with respect to graph minors

Συγγραφείς: Zhai, Mingqing ^a, Fang, Longfei ^{b, c}, Lin, Huiqiu ^{b, ⁎}

Πηγή: In Journal of Combinatorial Theory, Series A August 2026 222

Perfect Matchings in Random Sparsifications of Dirac Hypergraphs: Perfect matchings in random sparsifications of Dirac hypergraphs

Συγγραφείς: Dong Yeap Kang, Tom Kelly 0001, Daniela Kühn, Deryk Osthus, Vincent Pfenninger

Πηγή: Combinatorica

Θεματικοί όροι: perfect matching, Random graphs (graph-theoretic aspects), Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.), 0102 computer and information sciences, random hypergraph, Hypergraphs, 01 natural sciences, Shamir's problem, spreadness, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), absorbing method, threshold, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, random graph

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2211.01325

Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures: Tiling edge-ordered graphs with monotone paths and other structures

Συγγραφείς: Igor Araujo, Simón Piga, Andrew Treglown, Zimu Xiang

Πηγή: SIAM Journal on Discrete Mathematics. 38:1808-1839

Θεματικοί όροι: Extremal problems in graph theory, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Combinatorial aspects of tessellation and tiling problems, absorbing method, FOS: Mathematics, Mathematics - Combinatorics, edge-ordered graphs, tilings, Combinatorics (math.CO), Paths and cycles

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2305.07294
https://zbmath.org/7870754
https://doi.org/10.1137/23m1572519

Ramsey numbers for multiple copies of sparse graphs

Συγγραφείς: Aurelio L. Sulser, Milos Trujic

Πηγή: Journal of Graph Theory. 106:843-870

Θεματικοί όροι: absorbing method, FOS: Mathematics, Ramsey theory, Generalized Ramsey theory, Mathematics - Combinatorics, Density (toughness, etc.), Combinatorics (math.CO), disjoint union, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, sparse graphs

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2212.02455

Spanning trees in graphs without large bipartite holes

Συγγραφείς: Jie Han 0002, Jie Hu, Lidan Ping, Guanghui Wang 0002, Yi Wang, Donglei Yang

Πηγή: Combinatorics, Probability and Computing. 33:270-285

Θεματικοί όροι: Extremal problems in graph theory, bipartite holes, absorbing method, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 0101 mathematics, spanning trees, 01 natural sciences, Trees

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2302.03966

On oriented cycles in randomly perturbed digraphs

Συγγραφείς: Igor Araujo, József Balogh, Robert A. Krueger, Simón Piga, Andrew Treglown

Πηγή: Combinatorics, Probability and Computing. 33:157-178

Θεματικοί όροι: Eulerian and Hamiltonian graphs, Random graphs (graph-theoretic aspects), Directed graphs (digraphs), tournaments, cycles, Vertex degrees, 0102 computer and information sciences, directed graphs, 01 natural sciences, absorbing method, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, Paths and cycles

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2212.10112
https://zbmath.org/7938719
https://doi.org/10.1017/s0963548323000391

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

Συγγραφείς: Hongliang Lu, Yan Wang, Xingxing Yu

Πηγή: Journal of Combinatorial Theory, Series B. 163:83-111

Θεματικοί όροι: rainbow matching, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), absorbing method, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, Hypergraphs, co-degree threshold, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2111.00372
https://zbmath.org/7740008
https://doi.org/10.1016/j.jctb.2023.07.003

Embedding clique-factors in graphs with low ℓ-independence number: Embedding clique-factors in graphs with low \(\ell\)-independence number

Συγγραφείς: Fan Chang, Jie Han 0002, Jaehoon Kim, Guanghui Wang 0002, Donglei Yang

Πηγή: Journal of Combinatorial Theory, Series B. 161:301-330

Θεματικοί όροι: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), absorbing method, regularity method, Ramsey theory, FOS: Mathematics, Mathematics - Combinatorics, Ramsey-Turán problem, 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, 01 natural sciences, \(H\)-factor

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2111.10512
https://zbmath.org/7681182
https://doi.org/10.1016/j.jctb.2023.02.008

Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs: Large \(Y_{k,b}\)-tilings and Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs

Συγγραφείς: Luyining Gan, Jie Han 0002, Lin Sun, Guanghui Wang 0002

Πηγή: Journal of Graph Theory. 104:516-556

Θεματικοί όροι: Eulerian and Hamiltonian graphs, hypergraph regularity method, hypergraph, 0102 computer and information sciences, Hypergraphs, 01 natural sciences, Combinatorial aspects of tessellation and tiling problems, absorbing method, Hamilton cycle, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, Paths and cycles

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2109.00722
https://zbmath.org/7746085
https://doi.org/10.1002/jgt.22988

Tiling multipartite hypergraphs in quasi-random hypergraphs

Συγγραφείς: Laihao Ding, Jie Han 0002, Shumin Sun, Guanghui Wang 0002, Wenling Zhou

Πηγή: Journal of Combinatorial Theory, Series B. 160:36-65

Θεματικοί όροι: Extremal problems in graph theory, Random graphs (graph-theoretic aspects), Vertex degrees, 0102 computer and information sciences, Hypergraphs, 01 natural sciences, multipartite hypergraph, \(F\)-factor, absorbing method, FOS: Mathematics, Mathematics - Combinatorics, quasi-random hypergraph, Combinatorics (math.CO), 0101 mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2111.14140
https://zbmath.org/7667215
https://doi.org/10.1016/j.jctb.2022.12.005

On powers of tight Hamilton cycles in randomly perturbed hypergraphs

Συγγραφείς: Yulin Chang, Jie Han, Lubos Thoma

Πηγή: Random Structures & Algorithms. 63:591-609

Θεματικοί όροι: Eulerian and Hamiltonian graphs, absorbing method, randomly perturbed hypergraphs, Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 0101 mathematics, Hypergraphs, 01 natural sciences, powers of Hamilton cycles

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2007.11775

Ramsey numbers for multiple copies of sparse graphs

Συγγραφείς: Sulser, Aurelio, Trujić, Miloš

Πηγή: Journal of Graph Theory, 106 (4)

Θεματικοί όροι: absorbing method, disjoint union, Ramsey theory, sparse graphs

Περιγραφή αρχείου: application/application/pdf

Σύνδεσμος πρόσβασης: http://hdl.handle.net/20.500.11850/669209

Matching of Given Sizes in Hypergraphs: Matching of given sizes in hypergraphs

Συγγραφείς: Yulin Chang, Huifen Ge, Jie Han 0002, Guanghui Wang 0002

Πηγή: SIAM Journal on Discrete Mathematics. 36:2323-2338

Θεματικοί όροι: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), matching, absorbing method, hypergraph, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 0101 mathematics, Hypergraphs, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2106.16068

Rainbow Perfect Matchings for 4-Uniform Hypergraphs: Rainbow perfect matchings for 4-uniform hypergraphs

Συγγραφείς: Hongliang Lu, Yan Wang, Xingxing Yu

Πηγή: SIAM Journal on Discrete Mathematics. 36:1645-1662

Θεματικοί όροι: Extremal problems in graph theory, perfect matching, hypergraph, 0102 computer and information sciences, Hypergraphs, 01 natural sciences, rainbow matching, Coloring of graphs and hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), absorbing method, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2105.08608
https://zbmath.org/7565116
https://doi.org/10.1137/21m1442383

Tilings in vertex ordered graphs

Συγγραφείς: József Balogh, Lina Li, Andrew Treglown

Πηγή: Journal of Combinatorial Theory, Series B. 155:171-201

Θεματικοί όροι: Extremal problems in graph theory, factors, 0102 computer and information sciences, Hypergraphs, 01 natural sciences, Coloring of graphs and hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), absorbing method, regularity method, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, Dirac-type problems, ordered graphs, Paths and cycles

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/2007.10832
http://arxiv.org/abs/2007.10832
https://zbmath.org/7514798
https://doi.org/10.1016/j.jctb.2022.02.006

Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs: Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs

Συγγραφείς: Hiêp Hàn, Jie Han 0002, Yi Zhao 0005

Πηγή: Journal of Combinatorial Theory, Series B. 153:105-148

Θεματικοί όροι: Eulerian and Hamiltonian graphs, Extremal problems in graph theory, hypergraph, Vertex degrees, 0102 computer and information sciences, Hypergraphs, 01 natural sciences, regularity lemma, absorbing method, Hamilton cycle, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/2002.12234
http://arxiv.org/abs/2002.12234
https://zbmath.org/7464275
https://doi.org/10.1016/j.jctb.2021.11.003

Covering cycles in sparse graphs

Συγγραφείς: Mousset, Frank, Škorić, Nemanja, Trujić, Miloš

Πηγή: Random Structures & Algorithms, 60 (4)

Θεματικοί όροι: absorbing method, covering cycles, pseudo-random graphs, random graphs, resilience, 0102 computer and information sciences, 01 natural sciences, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Mathematics - Combinatorics, Density (toughness, etc.), Combinatorics (math.CO), 0101 mathematics, Paths and cycles

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/2003.03311
http://arxiv.org/abs/2003.03311
http://hdl.handle.net/20.500.11850/508224

Factors in randomly perturbed hypergraphs

Συγγραφείς: Yulin Chang, Jie Han 0002, Yoshiharu Kohayakawa, Patrick Morris 0001, Guilherme Oliveira Mota

Πηγή: Random Structures & Algorithms. 60:153-165

Θεματικοί όροι: spanning structures, absorbing method, Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 0101 mathematics, Hypergraphs, randomly perturbed graphs, 01 natural sciences, random graphs

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/2008.01031
http://arxiv.org/abs/2008.01031
https://zbmath.org/7749512
https://doi.org/10.1002/rsa.21035

DECISION PROBLEM FOR PERFECT MATCHINGS IN DENSE 𝑘-UNIFORM HYPERGRAPHS

Συγγραφείς: HAN, JIE

Πηγή: Transactions of the American Mathematical Society, 2017 Jul 01. 369(7), 5197-5218.

Σύνδεσμος πρόσβασης: https://www.jstor.org/stable/90006145

The complexity of perfect matchings and packings in dense hypergraphs

Συγγραφείς: Han, Jie ^a, Treglown, Andrew ^b

Πηγή: In Journal of Combinatorial Theory, Series B March 2020 141:72-104