المؤلفون: Hunter, Zach, Milojević, Aleksa, Sudakov, Benny, Tomon, István

المصدر: Journal of combinatorial theory. Series B (Print). 172:168-197

مصطلحات موضوعية: Dependent random choice, Induced subgraphs, Turán-type problems, Zarankiewicz problem

وصف الملف: electronic

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-234334
https://doi.org/10.1016/j.jctb.2024.12.009
https://umu.diva-portal.org/smash/get/diva2:1929485/FULLTEXT01.pdf

المؤلفون: Balbuena, Camino, García Vázquez, Pedro, Marcote Ordax, Xavier, Valenzuela Tripodoro, Juan Carlos

المساهمون: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM240: Invariantes en Teoría de Grafos y Optimización, Ministerio de Educación y Ciencia (MEC). España, European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER), Junta de Andalucía

مصطلحات موضوعية: Zarankiewicz problem, Extremal graph theory, Forbidden subgraphs

Relation: Discrete Mathematics & Theoretical Computer Science (DMTCS), 10 (3), 35-48.; MTM2005-08990-C02-02; P06-FQM-01649; https://dmtcs.episciences.org/435/pdf; https://idus.us.es/handle//11441/154762

الاتاحة: https://idus.us.es/handle//11441/154762

المؤلفون: Yaser Rowshan, Mostafa Gholami, Stanford Shateyi

المصدر: Mathematics; Volume 10; Issue 5; Pages: 701

مصطلحات موضوعية: Ramsey numbers, bipartite Ramsey numbers, Zarankiewicz number

وصف الملف: application/pdf

Relation: Mathematics and Computer Science; https://dx.doi.org/10.3390/math10050701

الاتاحة: https://doi.org/10.3390/math10050701

المؤلفون: Block, Alexander R., Brânzei, Simina, Maji, Hemanta K., Mehta, Himanshi, Mukherjee, Tamalika, Nguyen, Hai H.

المساهمون: Alexander R. Block and Simina Brânzei and Hemanta K. Maji and Himanshi Mehta and Tamalika Mukherjee and Hai H. Nguyen

مصطلحات موضوعية: Secure keys, Secure private randomness, Gray-Wyner system, Cryptographic complexity, Nondeterministic communication complexity, Leakage-resilience, Combinatorial optimization, Product dimension, Zarankiewicz problem, Algebraic lower-bounding techniques, P₄-free partition number, P₄-free cover number

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 199, 2nd Conference on Information-Theoretic Cryptography (ITC 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.16

الاتاحة: https://doi.org/10.4230/LIPIcs.ITC.2021.16
https://nbn-resolving.org/urn:nbn:de:0030-drops-143357
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.16

المؤلفون: Conlon, David, Pohoata, Cosmin, Zakharov, Dmitriy

المصدر: Discrete Analysis, 2021, Art. No. 17, (2021-09-27)

مصطلحات موضوعية: ErdÅ‘s box problem, extremal numbers, Zarankiewicz problem, hypergraphs

Relation: https://arxiv.org/abs/2011.09024; https://youtu.be/g_l-s18vS4U; https://doi.org/10.19086/da.28336; eprintid:111772

الاتاحة: https://doi.org/10.19086/da.28336

المؤلفون: Balogh, József, Lidicky, Bernard, Norin, Sergey, Pfender, Florian, Salazar, Gelasio, Spiro, Sam

المساهمون: Mathematics

المصدر: https://doi.org/10.1016/j.procs.2023.08.216.

مصطلحات موضوعية: DegreeDisciplines::Physical Sciences and Mathematics::Mathematics, Zarankiewicz, crossing number, complete bipartite graph, flag algebras

وصف الملف: application/pdf

Relation: https://dr.lib.iastate.edu/handle/20.500.12876/jrl8QWMr

الاتاحة: https://dr.lib.iastate.edu/handle/20.500.12876/jrl8QWMr
https://hdl.handle.net/20.500.12876/jrl8QWMr

المؤلفون: David Conlon

المصدر: Mathematical Proceedings of the Cambridge Philosophical Society. 173:155-161

مصطلحات موضوعية: General Mathematics, 010102 general mathematics, 0102 computer and information sciences, 01 natural sciences, Upper and lower bounds, Combinatorics, Matrix (mathematics), Range (mathematics), 010201 computation theory & mathematics, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, Algebraic method, Constant (mathematics), Zarankiewicz problem, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58d7a28e70514d593103b7d85d3c9c71
https://doi.org/10.1017/s0305004121000475

المؤلفون: Hernández-Vélez, César, Medina, Carolina, Salazar, Gelasio

المصدر: The Electronic Journal of Combinatorics; Volume 21, Issue 4 (2014); P4.1 ; 1077-8926

مصطلحات موضوعية: Crossing numbers, complete bipartite graphs, Zarankiewicz Conjecture, 05C10, 05C62, 68R10

وصف الملف: application/pdf; application/zip; application/x-tar

Relation: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p1/pdf; https://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p1/5315; https://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p1/5497; https://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p1

الاتاحة: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p1
https://doi.org/10.37236/2777

المؤلفون: David Galvin, Artem Chernikov, Sergei Starchenko

المصدر: Selecta Mathematica, vol 26, iss 2

مصطلحات موضوعية: Lemma (mathematics), General Mathematics, 010102 general mathematics, General Physics and Astronomy, Pure Mathematics, 01 natural sciences, cs.CG, Combinatorics, 03C45, math.LO, 05D40, Cell decomposition, math.CO, 0101 mathematics, 05C35, Zarankiewicz problem, 03C64, Mathematics

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b1ed04f107016102fd718c2054a7641
https://doi.org/10.1007/s00029-020-0551-2

المؤلفون: Vladimir Nikiforov

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://arxiv.org/pdf/0903.5350v1.pdf.

مصطلحات موضوعية: bipartite subgraphs, Zarankiewicz problem, spectral radius

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.244.6384; http://arxiv.org/pdf/0903.5350v1.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.244.6384
http://arxiv.org/pdf/0903.5350v1.pdf

المؤلفون: Wilfrid S. Kendall, G. Montana

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.warwick.ac.uk/statsdept/Staff/WSK/papers/371.ps.gz.

مصطلحات موضوعية: ZARANKIEWICZ PROBLEM

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6326; http://www.warwick.ac.uk/statsdept/Staff/WSK/papers/371.ps.gz

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6326
http://www.warwick.ac.uk/statsdept/Staff/WSK/papers/371.ps.gz

المؤلفون: Maria Aguieiras A. de Freitas, Vladimir Nikiforov, Laura Patuzzi

المصدر: Linear Algebra and its Applications. 496:381-391

مصطلحات موضوعية: Discrete mathematics, Factor-critical graph, Numerical Analysis, Algebra and Number Theory, 010103 numerical & computational mathematics, 0102 computer and information sciences, Mathematics::Spectral Theory, 01 natural sciences, Complete bipartite graph, Combinatorics, Edge-transitive graph, 010201 computation theory & mathematics, Graph power, Discrete Mathematics and Combinatorics, Geometry and Topology, 0101 mathematics, Zarankiewicz problem, Graph factorization, Pancyclic graph, Forbidden graph characterization, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::2eadccd6d268b4c6a62b09c895b414d9
https://doi.org/10.1016/j.laa.2016.01.047

المؤلفون: J. Ian Munro, Patrick K. Nicholson

المصدر: Algorithmica. 76:445-473

مصطلحات موضوعية: General Computer Science, Applied Mathematics, Transitive closure, Directed graph, 16. Peace & justice, Data structure, Transitive reduction, Computer Science Applications, Combinatorics, Succinct data structure, Reachability, Partially ordered set, Zarankiewicz problem, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::7a030a559add34dc6d856f64c0b9a410
https://doi.org/10.1007/s00453-015-0047-1

المؤلفون: Xing Peng, Craig Timmons, Rafael Tesoro

المصدر: Discrete Mathematics. 338:183-190

مصطلحات موضوعية: Discrete mathematics, 11B83, Disjoint sets, Theoretical Computer Science, Extremal graph theory, Combinatorics, Integer, FOS: Mathematics, Mathematics - Combinatorics, Discrete Mathematics and Combinatorics, Combinatorics (math.CO), Abelian group, Zarankiewicz problem, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c033fe0694606d5279186c68a4e03b9f
https://doi.org/10.1016/j.disc.2014.11.006

المؤلفون: Michael Tait, Craig Timmons

مصطلحات موضوعية: 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, Function (mathematics), 01 natural sciences, Upper and lower bounds, Graph, Extremal graph theory, Combinatorics, Integer, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Combinatorics (math.CO), Zarankiewicz problem, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4df0adf18eb9593cb7bf9c9e6756a581
http://arxiv.org/abs/1801.09219

المؤلفون: Cavalet, Lilian

المساهمون: Allem, Luiz Emílio

المصدر: Biblioteca Digital de Teses e Dissertações da UFRGS
Universidade Federal do Rio Grande do Sul (UFRGS)
instacron:UFRGS

مصطلحات موضوعية: Signless Laplacian matrix, Teoria espectral, Adjacency matrix, Zarankiewicz problem, Normalized Laplacian matrix, Laplacian matrix, Grafos, Index

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=od______3056::0f9ae7820332e69266022a5fe15663aa

المؤلفون: Kai Shi, Sheng Lin, Guangping Xu, Qunfang Mao, Hua Zhang

المصدر: ICC

مصطلحات موضوعية: Discrete mathematics, Optimization problem, Bandwidth (signal processing), 020206 networking & telecommunications, 010103 numerical & computational mathematics, 02 engineering and technology, 01 natural sciences, Bin, Extremal graph theory, Combinatorics, Combinatorial design, 0202 electrical engineering, electronic engineering, information engineering, Ball (bearing), Bipartite graph, 0101 mathematics, Zarankiewicz problem, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::af54f13999717426a2a1582e72da8f90
https://doi.org/10.1109/icc.2016.7510829

المؤلفون: János Pach, Nabil H. Mustafa

المساهمون: Laboratoire d'Informatique Gaspard-Monge (LIGM), Centre National de la Recherche Scientifique (CNRS)-Fédération de Recherche Bézout-ESIEE Paris-École des Ponts ParisTech (ENPC)-Université Paris-Est Marne-la-Vallée (UPEM), Département de Mathématiques - EPFL, Ecole Polytechnique Fédérale de Lausanne (EPFL), ANR-14-CE25-0016,SAGA,Approximation geometrique structurelle pour l'algorithmique(2014)

المصدر: Journal of Combinatorial Theory, Series A
Journal of Combinatorial Theory, Series A, Elsevier, 2016, 141, pp.1-7. ⟨10.1016/j.jcta.2016.02.001⟩
Lecture Notes in Computer Science ISBN: 9783319272603
Graph Drawing

مصطلحات موضوعية: Discrete mathematics, Hypergraph, Intersection graphs, Fundamental theorem, 010102 general mathematics, Dimension (graph theory), Zarankiewicz problem, [SCCO.COMP]Cognitive science/Computer science, 0102 computer and information sciences, Intersection graph, 01 natural sciences, Theoretical Computer Science, Vertex (geometry), Combinatorics, Computational Theory and Mathematics, Intersection, Cuttings, 010201 computation theory & mathematics, Computer Science::Discrete Mathematics, Exponent, Discrete Mathematics and Combinatorics, Simplices, 0101 mathematics, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e780aebf08532bce2539bd3fabe222a
https://hal.archives-ouvertes.fr/hal-01345859

المؤلفون: Camino Balbuena, J. C. Valenzuela, P. García-Vázquez, X. Marcote

المصدر: Discrete Mathematics. 307:2322-2327

مصطلحات موضوعية: Discrete mathematics, Mathematics::Combinatorics, Extremal graph theory, Zarankiewicz problem, Graph theory, T-vertices, Theoretical Computer Science, Combinatorics, Computer Science::Discrete Mathematics, Bipartite graph, Forbidden subgraphs, Discrete Mathematics and Combinatorics, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::441bdda4b8ea720f5ca691377c218ce5
https://doi.org/10.1016/j.disc.2006.11.002

المؤلفون: P. García–Vázquez, J. C. Valenzuela, Camino Balbuena, X. Marcote

المصدر: Electronic Notes in Discrete Mathematics. 26:139-144

مصطلحات موضوعية: Combinatorics, Discrete mathematics, Erdős–Stone theorem, Edge-transitive graph, Applied Mathematics, Triangle-free graph, Bipartite graph, Discrete Mathematics and Combinatorics, Zarankiewicz problem, Complete bipartite graph, Pancyclic graph, Extremal graph theory, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::2f345988979b0cc86cfcd2136d9bb49b
https://doi.org/10.1016/j.endm.2006.08.011