Suchergebnisse - classification ams::05 combinatorics::05d extremal combinatorics

Extremal Combinatorics : With Applications in Computer Science

Autoren: Stasys Jukna

Resource Type: eBook.

Schlagworte: Combinatorial analysis, Extremal problems (Mathematics), Computer science--Mathematics

Categories: COMPUTERS / Computer Science, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Number Theory, MATHEMATICS / Numerical Analysis

Extremal Combinatorics

Autoren: Stasys Jukna

Resource Type: eBook.

Schlagworte: Combinatorial analysis, Extremal problems (Mathematics)

Categories: COMPUTERS / Computer Science, MATHEMATICS / Applied, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Logic, MATHEMATICS / Probability & Statistics / General

Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs

Autoren: Cáceres, José Hernando Martín, María del Carmen Mora Giné, Mercè et al.

Weitere Verfasser: Cáceres, José Hernando Martín, María del Carmen Mora Giné, Mercè et al.

Quelle: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Applicable Analysis and Discrete Mathematics

Schlagwörter: Àrees temàtiques de la UPC::Matemàtiques i estadística, Teoria de, Graph, theory, Grafs, Teoria de, Matemàtiques i estadística [Àrees temàtiques de la UPC], Classificació AMS::05 Combinatorics::05C Graph theory, 0102 computer and information sciences, 01 natural sciences, Graph, Grafs, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, theory, NP-complete decision problem, 05 Combinatorics::05C Graph theory [Classificació AMS], Broadcast, domination

Dateibeschreibung: application/pdf

Zugangs-URL: http://www.doiserbia.nb.rs/ft.aspx?id=1452-86301801205C
http://arxiv.org/abs/1710.05953
http://hdl.handle.net/2117/117013
http://www.doiserbia.nb.rs/Article.aspx?id=1452-86301801205C
https://upcommons.upc.edu/handle/2117/117013
https://upcommons.upc.edu/bitstream/2117/117013/1/versionfinalAADM.pdf
http://www.doiserbia.nb.rs/ft.aspx?id=1452-86301801205C

An overview of the degree/diameter problem for directed, undirected and mixed graphs

Autoren: Miller, Mirka

Quelle: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Schlagwörter: Graph theory, 05 Combinatorics::05D Extremal combinatorics [Classificació AMS], Grafs, Teoria de, Classificació AMS::05 Combinatorics::05D Extremal combinatorics, Extremal problems (Mathematics), Classificació AMS::05 Combinatorics::05C Graph theory, Problemes extrems (Matemàtica), 05 Combinatorics::05C Graph theory [Classificació AMS], Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs, Directed graphs, Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs [Àrees temàtiques de la UPC]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/2099/10382
http://hdl.handle.net/2099/10382

Some Basic Properties of the Second Multiplicative Zagreb Eccentricity Index.

Autoren: Azari, Mahdieh

Quelle: Iranian Journal of Mathematical Chemistry; Mar2024, Vol. 15 Issue 1, p17-25, 9p

Schlagwörter: GRAPH grammars, MOLECULAR connectivity index, INDEXES, GRAPH theory, COMBINATORICS, EXTREMAL problems (Mathematics), TOPOLOGICAL dynamics

Multiplicative Zagreb Indices and Extremal Complexity of Line Graphs.

Autoren: Došlić, Tomislav

Quelle: Iranian Journal of Mathematical Chemistry; Mar2024, Vol. 15 Issue 1, p7-16, 10p

Schlagwörter: GRAPH grammars, SPANNING trees, TREE graphs, INDEXES, COMBINATORICS, MATHEMATICAL analysis

Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs.

Autoren: FALGAS-RAVRY, VICTOR VAUGHAN, EMIL R.

Quelle: Combinatorics, Probability & Computing; Jan2013, Vol. 22 Issue 1, p21-54, 34p

Schlagwörter: GRAPH theory, SET theory, PROBLEM solving, HYPERGRAPHS, CALCULUS, EXTREMAL combinatorics, SUBGRAPHS

c Birkhauser Verlag, Basel, 2005 Annals of Combinatorics A Characterization of Designs Related to an Extremal Doubly-Even Self-Dual Code of Length 48

Autoren: Masaaki Harada Akihiro Munemasa Vladimir D. Tonchev et al.

Weitere Verfasser: Masaaki Harada Akihiro Munemasa Vladimir D. Tonchev et al.

Quelle: http://www.combinatorics.net/new/Annals/Abstract/pdf/9_2_189.pdf.

Schlagwörter: References

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.538.2610; http://www.combinatorics.net/new/Annals/Abstract/pdf/9_2_189.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.538.2610
http://www.combinatorics.net/new/Annals/Abstract/pdf/9_2_189.pdf

Extremal Bicyclic 3-Chromatic Graphs.

Autoren: Tomescu, Ioan Javed, Sana

Quelle: Graphs & Combinatorics; Jul2015, Vol. 31 Issue 4, p1043-1052, 10p

Schlagwörter: GRAPH coloring, MATHEMATICAL inequalities, CHROMATIC polynomial, GRAPH connectivity, PARTIALLY ordered sets, COMBINATORICS

Infinitesimally extremal Beltrami differentials of non-landslide type.

Autoren: Yao, Guowu

Quelle: Complex Variables & Elliptic Equations; Nov2017, Vol. 62 Issue 11, p1601-1610, 10p

Schlagwörter: TEICHMULLER spaces, INFINITY (Mathematics), DIFFERENTIAL equations, EXTREMAL combinatorics, GEOMETRIC function theory

Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms

Autoren: Fomin, Fedor Golovach, Petr Sagunov, Danil et al.

Relation: Norges forskningsråd: 314528

Verfügbarkeit: https://hdl.handle.net/11250/3042300

Two-Part and k-Sperner Families: New Proofs Using Permutations.

Autoren: Erdős, Péter L. Füredi, Zoltán Katona, Gyula O. H.

Quelle: SIAM Journal on Discrete Mathematics; 2005, Vol. 19 Issue 2, p489, 12p

Schlagwörter: EXTREMAL problems (Mathematics), CALCULUS of variations, SPERNER theory, COMBINATORICS, PERMUTATIONS, MATHEMATICAL programming, COMPUTER programming, DISCRETE mathematics

MAXIMUM SIZE OF REVERSE-FREE SETS OF PERMUTATIONS.

Autoren: CIBULKA, JOSEF

Quelle: SIAM Journal on Discrete Mathematics; 2013, Vol. 27 Issue 1, p232-239, 8p

Schlagwörter: PERMUTATIONS, EXTREMAL combinatorics, LETTERS, VOCABULARY, COMBINATORICS

The extremal index for GARCH(1, 1) processes.

Autoren: Laurini, Fabrizio Tawn, Jonathan

Quelle: Extremes; Dec2012, Vol. 15 Issue 4, p511-529, 19p

Schlagwörter: GARCH model, HETEROSCEDASTICITY, EXTREMAL problems (Mathematics), EXTREMAL combinatorics, SYMMETRIC functions, GAUSSIAN distribution, GAUSSIAN processes

EXTREMAL SETS MINIMIZING DIMENSION-NORMALIZED BOUNDARY IN HAMMING GRAPHS.

Autoren: Azizo&gcaron;lu, M. Cemil E&gcaron;ecio&gcaron;lu, Ömer

Quelle: SIAM Journal on Discrete Mathematics; 2003, Vol. 17 Issue 2, p219-236, 18p

Schlagwörter: GRAPH theory, SET theory, MATHEMATICS, COMBINATORICS, TOPOLOGY, MATHEMATICAL analysis

ON EXTREMAL κ-GRAPHS WITHOUT REPEATED COPIES OF 2-INTERSECTING EDGES.

Autoren: Chee, Yeow Meng Ling, Alan C. H.

Quelle: SIAM Journal on Discrete Mathematics; 2007, Vol. 21 Issue 3, p805-821, 17p, 5 Diagrams, 1 Chart

Schlagwörter: EXTREMAL problems (Mathematics), EXTREMAL combinatorics, COMBINATORIAL designs & configurations, HYPERGRAPHS, GRAPH theory

Radially Moore graphs of radius three and large odd degree

Autoren: López, Nacho Gómez Martí, José

Quelle: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Schlagwörter: Graph theory, 05 Combinatorics::05D Extremal combinatorics [Classificació AMS], Grafs, Teoria de, Classificació AMS::05 Combinatorics::05D Extremal combinatorics, Extremal problems (Mathematics), Classificació AMS::05 Combinatorics::05C Graph theory, Problemes extrems (Matemàtica), 05 Combinatorics::05C Graph theory [Classificació AMS], Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs, Directed graphs, Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs [Àrees temàtiques de la UPC]

Dateibeschreibung: application/pdf

Zugangs-URL: http://hdl.handle.net/2099/10376
https://hdl.handle.net/2099/10376

A TWO-SET PROBLEM ON COLORING THE INTEGERS.

Autoren: Ryan, Jeffrey A.

Quelle: SIAM Journal on Discrete Mathematics; 2007, Vol. 21 Issue 3, p731-736, 6p

Schlagwörter: NUMBER theory, MATHEMATICAL inequalities, RAMSEY theory, EXTREMAL combinatorics, GRAPH coloring

Every Large Point Set contains Many Collinear Points or an Empty Pentagon

Autoren: Wood, David Por, Attila Abel, Zachary et al.

Weitere Verfasser: Wood, David Por, Attila Abel, Zachary et al.

Quelle: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

Schlagwörter: Pentagon, Computational Geometry (cs.CG), FOS: Computer and information sciences, Empty pentagon, Ramsey, Teoria de, Classificació AMS::05 Combinatorics::05D Extremal combinatorics, Erdo{double acute}s-Szekeres theorem, Happy end problem, 0102 computer and information sciences, Geometria discreta, Matemàtiques i estadística::Geometria::Geometria convexa i discreta [Àrees temàtiques de la UPC], 01 natural sciences, Big line or big clique conjecture, Hexagons, Informatique mathématique, FOS: Mathematics, Mathematics - Combinatorics, 0101 mathematics, Classificació AMS::52 Convex and discrete geometry::52C Discrete geometry, Teoria de, Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria convexa i discreta, Ramsey theory, Discrete geometry, 52 Convex and discrete geometry::52C Discrete geometry [Classificació AMS], Geometria convexa, 05 Combinatorics::05D Extremal combinatorics [Classificació AMS], Convex geometry, Empty quadrilateral, Empty hexagon, 52C10, 05D10, Computer Science - Computational Geometry, Combinatorics (math.CO), Ramsey

Dateibeschreibung: application/pdf; No full-text files

Zugangs-URL: http://arxiv.org/PS_cache/arxiv/pdf/0904/0904.0262v2.pdf
http://arxiv.org/abs/0904.0262
http://hdl.handle.net/2117/11669
https://ui.adsabs.harvard.edu/abs/2009arXiv0904.0262A/abstract
https://arxiv.org/pdf/0904.0262.pdf
https://arxiv.org/abs/0904.0262
https://hdl.handle.net/2117/11669
https://doi.org/10.1007/s00373-010-0957-2

Algebraic, extremal and metric combinatorics, 1986 / ed. by M-M Deza & P. Frankl and I. G. Rosenberg.

Weitere Verfasser: Deza, Michel (1934- ). Frankl, Péter (1953- ). Rosenberg, Ivo G. (1939- ).

Quelle: Bibliogr. przy pracach.

Zugangs-URL: http://katalog.nukat.edu.pl/lib/item?id=chamo:2327185&theme=nukat