The planar Turán number of double stars S2,l: The planar Turán number of double stars \(S_{2,l}\)

Συγγραφείς: Xin Xu, Jiawei Shao, Qiang Zhou

Πηγή: Discrete Applied Mathematics. 369:131-136

Θεματικοί όροι: Extremal problems in graph theory, extremal graphs, double stars \(S_{2, l}\), planar Turán number, Enumeration in graph theory

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

Σύνδεσμος πρόσβασης: https://zbmath.org/8028619
https://doi.org/10.1016/j.dam.2025.03.016

Minimum degree and size conditions for the graphs of proper connection number 2

Συγγραφείς: Zhenzhen Li, Baoyindureng Wu

Πηγή: Discrete Applied Mathematics. 367:179-194

Θεματικοί όροι: Connectivity, Extremal problems in graph theory, Coloring of graphs and hypergraphs, proper connection number, Vertex degrees, edge-colored graph

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

Σύνδεσμος πρόσβασης: https://zbmath.org/8012125
https://doi.org/10.1016/j.dam.2025.02.011

Packing two copies of a tree into a bipartite graph with restrained maximum degree

Συγγραφείς: Li, Hui, Gao, Yunshu

Πηγή: Discrete Applied Mathematics. 366:23-34

Θεματικοί όροι: Extremal problems in graph theory, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), maximal degree, Vertex degrees, \((a,b)\)-bipartite, 2-packing, tree

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

Tverberg Partition Graphs: Tverberg partition graphs

Συγγραφείς: Deborah Oliveros, Érika Roldán, Pablo Soberón, Antonio J. Torres

Πηγή: SIAM Journal on Discrete Mathematics. 39:863-880

Θεματικοί όροι: Extremal problems in graph theory, Other problems of combinatorial convexity, flip graphs, Enumeration in graph theory, Helly-type theorems and geometric transversal theory, partition graph, discrete configuration spaces, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, reconfiguration problems, Mathematics - Combinatorics, Tverberg's theorem, Combinatorics (math.CO), combinatorial geometry

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

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

Twin-Width of Subdivisions of Multigraphs: Twin-width of subdivisions of multigraphs

Συγγραφείς: Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Sang-il Oum

Πηγή: SIAM Journal on Discrete Mathematics. 39:783-833

Θεματικοί όροι: FOS: Computer and information sciences, Extremal problems in graph theory, Distance in graphs, Discrete Mathematics (cs.DM), Discrete Mathematics, Graph minors, twin-width, graph minor, 05C35, 05C75, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Combinatorics, Graph theory (including graph drawing) in computer science, subdivision, FOS: Mathematics, multigraph, Structural characterization of families of graphs, Combinatorics (math.CO)

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

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

Bipartite q-Kneser graphs and two-generated irreducible linear groups: Bipartite \(q\)-Kneser graphs and two-generated irreducible linear groups

Συγγραφείς: Glasby, S. P., Niemeyer, Alice Catherine, Praeger, Cheryl E.

Πηγή: Linear algebra and its applications : LAA 710, 203-229 (2025). doi:10.1016/j.laa.2025.01.032

Θεματικοί όροι: Representation theory for linear algebraic groups, Extremal problems in graph theory, closed \(k\)-arc, Graphs and linear algebra (matrices, eigenvalues, etc.), \(k\)-walk, 05C50, 20C30, 20-08, 05C35, Group Theory (math.GR), \(q\)-Kneser graph, Graphs and abstract algebra (groups, rings, fields, etc.), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), stingray element, Mathematics - Group Theory, irreducible linear group

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2312.05529
https://zbmath.org/7996642
https://doi.org/10.1016/j.laa.2025.01.032
https://publications.rwth-aachen.de/record/1006980

Error-correcting open-locating-dominating sets

Συγγραφείς: Jean, Devin C., Seo, Suk J.

Πηγή: Congressus Numerantium. 235:23-40

Θεματικοί όροι: open-locating-dominating sets, error-correction, Extremal problems in graph theory, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Coloring of graphs and hypergraphs, detection system, extremal graphs, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), cubic graphs, Theory of error-correcting codes and error-detecting codes, NP-completeness, infinite grids

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

Maximal Degrees in Subgraphs of Kneser Graphs: Maximal degrees in subgraphs of Kneser graphs

Συγγραφείς: Peter Frankl, Andrey Kupavskii

Πηγή: Journal of Graph Theory. 109:88-96

Θεματικοί όροι: FOS: Computer and information sciences, Extremal problems in graph theory, Discrete Mathematics (cs.DM), Vertex degrees, 0102 computer and information sciences, intersecting families, Kneser graphs, 01 natural sciences, sensitivity conjecture, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), 0101 mathematics, Computer Science - Discrete Mathematics

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

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

Weak Rainbow Saturation Numbers of Graphs: Weak rainbow saturation numbers of graphs

Συγγραφείς: Xihe Li, Jie Ma, Tianying Xie

Πηγή: Journal of Graph Theory. 109:35-42

Θεματικοί όροι: Extremal problems in graph theory, Coloring of graphs and hypergraphs, weakly rainbow saturation, FOS: Mathematics, edge-coloring, Mathematics - Combinatorics, Combinatorics (math.CO), saturation number

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

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

Total mutual-visibility in Hamming graphs

Συγγραφείς: Csilla Bujt�s, Sandi Klav�ar, Jing Tian

Πηγή: Opuscula Mathematica, Vol 45, Iss 1, Pp 63-78 (2024)

Θεματικοί όροι: T57-57.97, Extremal problems in graph theory, Applied mathematics. Quantitative methods, Distance in graphs, Graph operations (line graphs, products, etc.), total mutual-visibility set, Hypergraphs, hamming graph, Hamming graph, turán-type problem, mutual-visibility set, FOS: Mathematics, Mathematics - Combinatorics, Turán-type problem, Combinatorics (math.CO), Paths and cycles

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2307.05168
https://doaj.org/article/eb42822f53774b6eb584b503b6241fac
https://doi.org/10.7494/OpMath.2025.45.1.63

C10 Has Positive Turán Density in the Hypercube: \(C_{10}\) has positive Turán density in the hypercube

Συγγραφείς: Alexandr Grebennikov, João Pedro Marciano

Πηγή: Journal of Graph Theory. 109:31-34

Θεματικοί όροι: even cycles, Extremal problems in graph theory, extremal graph theory, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 0101 mathematics, Enumeration in graph theory, Hypergraphs, 01 natural sciences, hypercube

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

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

Extremal Problems for a Matching and Any Other Graph: Extremal problems for a matching and any other graph

Συγγραφείς: Xiutao Zhu, Yaojun Chen

Πηγή: Journal of Graph Theory. 109:19-24

Θεματικοί όροι: Extremal problems in graph theory, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), matching, FOS: Mathematics, Mathematics - Combinatorics, extremal theory, Structural characterization of families of graphs, Combinatorics (math.CO), 0102 computer and information sciences, 0101 mathematics, Enumeration in graph theory, generalized Turán number, 01 natural sciences

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

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

Improving the Caro–Wei bound and applications to Turán stability: Improving the Caro-Wei bound and applications to Turán stability

Συγγραφείς: Tom Kelly, Luke Postle

Πηγή: Discrete Applied Mathematics. 358:33-43

Θεματικοί όροι: Extremal problems in graph theory, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Coloring of graphs and hypergraphs, Brooks' theorem, Caro-Wei theorem, 4. Education, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), independence number, simplicial vertices, Turán stability

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2407.17363
https://zbmath.org/7919051
https://doi.org/10.1016/j.dam.2024.06.006

Matchings in bipartite graphs with a given number of cuts

Συγγραφείς: Jinfeng Liu, Fei Huang

Πηγή: Discrete Applied Mathematics. 359:303-309

Θεματικοί όροι: Extremal problems in graph theory, quasi-order, cut vertex, bipartite graphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), cut edge, matchings, Hosoya index

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

On the spectral Turán problem of theta graphs

Συγγραφείς: Xu, Yi, Li, Xin

Πηγή: Linear Algebra and its Applications. 698:40-55

Θεματικοί όροι: spectral radius, Extremal problems in graph theory, Graphs and linear algebra (matrices, eigenvalues, etc.), extremal graph, theta graph

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

Σύνδεσμος πρόσβασης: https://zbmath.org/7901455
https://doi.org/10.1016/j.laa.2024.05.015

Embedding loose spanning trees in 3-uniform hypergraphs

Συγγραφείς: Yanitsa Pehova, Kalina Petrova

Πηγή: Journal of Combinatorial Theory, Series B, 168

Θεματικοί όροι: Minimum degree thresholds, Spanning trees, Extremal graph theory, extremal graph theory, 0102 computer and information sciences, Hypergraphs, EP/V038168/1, 01 natural sciences, Trees, Absorption, hypergraph regularity lemma, Hypergraph regularity lemma, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), FOS: Mathematics, Mathematics - Combinatorics, 05C35, 05Dxx, 05Cxx, Extremal problems in graph theory, CRSII5 173721, Dirac-type theorems, Minimum degree threshold, minimum degree thresholds, spanning trees, hypergraphs, external graph theory, Combinatorics (math.CO), dirac-type theorems, absorption

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2301.09630
https://zbmath.org/7873716
https://doi.org/10.1016/j.jctb.2024.04.003
http://hdl.handle.net/20.500.11850/672344
http://eprints.lse.ac.uk/122872/

Off-Diagonal Commonality of Graphs via Entropy: Off-diagonal commonality of graphs via entropy

Συγγραφείς: Natalie Behague, Natasha Morrison, Jonathan A. Noel

Πηγή: SIAM Journal on Discrete Mathematics. 38:2335-2360

Θεματικοί όροι: off-diagonal, 05C55, 05C35, Extremal problems in graph theory, common graph, homomorphism, Applications of graph theory, Ramsey theory, FOS: Mathematics, Generalized Ramsey theory, Sidorenko, Mathematics - Combinatorics, Combinatorics (math.CO)

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

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

Asymptotically Optimal Proper Conflict‐Free Coloring: Asymptotically optimal proper conflict-free coloring

Συγγραφείς: Chun‐Hung Liu, Bruce Reed

Πηγή: Random Structures & Algorithms. 66

Θεματικοί όροι: Connectivity, Extremal problems in graph theory, graph colouring, Coloring of graphs and hypergraphs, Lovász local lemma, FOS: Mathematics, Mathematics - Combinatorics, Vertex degrees, 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, quasi-random method, 01 natural sciences

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2401.02155
https://zbmath.org/8036330
https://doi.org/10.1002/rsa.21285

List Colorings of $k$-Partite $k$-Graphs: List colorings of \(k\)-partite \(k\)-graphs

Συγγραφείς: Dhawan, Abhishek

Πηγή: The Electronic Journal of Combinatorics. 32

Θεματικοί όροι: Extremal problems in graph theory, Coloring of graphs and hypergraphs, FOS: Mathematics, Mathematics - Combinatorics, Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.), Combinatorics (math.CO), Hypergraphs, list chromatic number of triangle free \(k\)-graphs, \(k\)-uniform hypergraph

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.03111
https://zbmath.org/8036395
https://doi.org/10.37236/12657

Turán Colourings in Off-Diagonal Ramsey Multiplicity: Turán colourings in off-diagonal Ramsey multiplicity

Συγγραφείς: Hyde, Joseph, Lee, Jae-baek, Noel, Jonathan A.

Πηγή: The Electronic Journal of Combinatorics. 32

Θεματικοί όροι: Ramsey goodness, Extremal problems in graph theory, Coloring of graphs and hypergraphs, uniformly random colouring, Ramsey theory, FOS: Mathematics, Generalized Ramsey theory, Combinatorics (math.CO), 05C35, 05D10

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

Σύνδεσμος πρόσβασης: https://zbmath.org/8036393
https://doi.org/10.37236/12751